Single Bit Research Articles

Evaluation of Single Event Upset on a Relay Protection Device

Traditionally, studies have primarily focused on single event effects in aerospace electronics. However, current research has confirmed that atmospheric neutrons can also induce single event effects in China’s advanced technology relay protection devices. Spallation neutron irradiation tests on a Loongson 2K1000 system-on-chip based relay protection device have revealed soft errors, including abnormal sampling, refusal of operation and interlock in the relay protection device. Given the absence of standardized evaluation methods for single event effects on relay protection devices, the following research emphasizes the use of Monte Carlo simulation and software fault injection. Various types of single event upsets, such as single bit upsets, dual bit upsets, and even eight bit upsets, were observed in Monte Carlo simulations where atmospheric neutrons hit the chip from different directions (top and bottom). The simulation results indicated that the single event effect sensitivity of the relay protection device was similar whether the neutron hit from the top or the bottom. Through software fault injection, the study also identified soft errors caused by neutron induced single event upsets on the Loongson 2K1000 system, including failure to execute, system halt, time out, and error result. And the soft error number of system halts and error results exceeded that of time outs and failures to execute in all three tested programs. This research represents a preliminary assessment of single event effects on relay protection devices and is expected to provide valuable insights for evaluating the reliability of advanced technology relay protection devices.

Design of Enhanced Reversible 9T SRAM Design for the Reduction in Sub-threshold Leakage Current with14nm FinFET Technology

Power dissipation is considered one of the important issues in low power Very-large-scale integration (VLSI) circuit design and is related to the threshold voltage. Generally, the sub-threshold leakage current and the leakage power dissipation are increased by reducing the threshold voltage. The overall performance of the circuit completely depends on this leakage power dissipation because this leakage and power consumption causes the components that are functioning by the battery for a long period to be washed-out rapidly. In this research, the reversible logic gate-based 9T static random access memory (SRAM) is designed in 14nm FinFET technology to reduce leakage power consumption in memory related applications. The Schmitt-trigger (ST)-based 9T SRAM cell is designed to attain high read-write stability and low power consumption using a single bit line structure. The reversible logic gates of Feynman (FG) and Fredkin gate (FRG) are combined to develop a row and column decoder in an SRAM design to diminish the leakage power. Moreover, the transistor stacking effect is applied to the proposed memory design to reduce the leakage power in active mode. The proposed reversible logic and transistor stacking based SRAM design is implemented in Tanner EDA Tool version 16.0. It also performs both read and write operations using the proposed circuit. The performance measures of read access time (RAT), write access time (WAT), read, write, and static power by varying supply voltage and temperature, delay and stability analysis (read/write static noise margin) are examined and compared with existing SRAM designs.

The minimal communication cost for simulating entangled qubits

We analyze the amount of classical communication required to reproduce the statistics of local projective measurements on a general pair of entangled qubits,|ΨAB⟩=p |00⟩+1−p |11⟩(with1/2≤p≤1). We construct a classical protocol that perfectly simulates local projective measurements on all entangled qubit pairs by communicating one classical trit. Additionally, when2p(1−p)2p−1log⁡(p1−p)+2(1−p)≤1, approximately0.835≤p≤1, we present a classical protocol that requires only a single bit of communication. The latter model even allows a perfect classical simulation with an average communication cost that approaches zero in the limit where the degree of entanglement approaches zero (p→1). This proves that the communication cost for simulating weakly entangled qubit pairs is strictly smaller than for the maximally entangled one.

Quantum Trajectories for Time-Local Non-Lindblad Master Equations.

For the efficient simulation of open quantum systems, we often use quantum jump trajectories given by pure states that evolve stochastically to unravel the dynamics of the underlying master equation. In the Markovian regime, when the dynamics is described by a Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equation, this procedure is known as MonteCarlo wave function approach. However, beyond ultraweak system-bath coupling, the dynamics of the system is not described by an equation of GKSL type, but rather by the Redfield equation, which can be brought into pseudo-Lindblad form. Here, negative dissipation strengths prohibit the conventional approach. To overcome this problem, we propose a pseudo-Lindblad quantum trajectory (PLQT) unraveling. It does not require an effective extension of the state space, like other approaches, except for the addition of a single classical bit. We test the PLQT for the eternal non-Markovian master equation for a single qubit and an interacting Fermi-Hubbard chain coupled to a thermal bath and discuss its computational effort compared to solving the full master equation.

Fully Homomorphic Encryption Scheme Over Integers Based on DGHV Scheme

Homomorphic encryption was introduced to enable untrusted parties to apply computation over encrypted data, without decrypting the message. It makes a promising future to solve security challenges with Cloud Computing. Still, because of complex problems, HE is not yet usable in real-world applications. However homomorphic encryption suffers from many complex issues like large-time computation, which is difficult to implement, and huge ciphertext size. In this paper, we take into account many vital homomorphic encryption schemes, all of them is depend on computing over integers, by converting the message to a binary format, then the ciphertext is calculated to every single bit of plaintext. So, we suggested another symmetric Fully Homomorphic encryption that depends on an integer number without converting it to binary format, it encrypts the message using a prime secret key. The proposed system is considered a great improvement to the DGHV system. Where it reduced the ciphertext size and the execution time significantly. The present proposed system shows an improvement of DGHV where it is faster about 23.8 times from DGHV, and we gain one ciphertext for the whole message instead of ciphertext for every bit of the message. The scheme's hardness depends on the greatest common divisor (GCD) problem. We present a detailed explanation of these schemes showing their efficient techniques and compare it with the proposed algorithm in terms of ciphertext size of algorithm, and execution time and analyze their security them finally draw several conclusions.

Novel Design of Ripple Carry Adder using High Speed 12T Hybrid MOS Transistors

This paper designs and extends a high speed full adder using 12 MOS Transistors to a ripple carry adder (RCA). The proposed design reduces delay and is effective for Power Delay Product (PDP). Using both complementary MOSFET (CMOS) logic and complementary pass transistor logic(CPL), a new 6T XNOR full adder(FA) is created. CPL is used in the design for Carry and Sum logic in order to minimise circuit delay. The proposed work has a delay of 11.86 ps and a PDP of 0.368fj. By using a newly proposed single bit adder, a 4-bit Ripple Carry Adder(RCA) is designed with 1.2 v supply yielding a power of 572.063uw, delay 0.32ns and PDP 183.06 fj. The outcomes obtained are compared with existing models. For characterstics of speed and PDP, the proposed model outperforms existing models significantly. The circuit was designed in 90nm GPDK technology by using the CADENCE VIRTUOSO TOOL.

Research on rock breaking mechanism of composite cone single cone bit

Composite cone single cone bit is a new type of single cone bit based on spherical single cone bit. Its unique structure changes the rock breaking method of traditional single cone bit, and the rock breaking efficiency and service life of the bit are improved in hard rock formation. One of the most influential is the shape of cone, which changes the trajectory and the cutter loads of the bit at the bottom of well, affecting the drilling efficiency and service life of bit. Based on experimental and numerical analysis methods, the rock breaking mechanism of two kinds of bits with different structural shapes was analyzed, and the following conclusions were obtained. 1) Rock breaking of composite single cone bit can be divided into three areas: long-distance scratch area, dense short distance scratch area and crushing pit area. 2) The direction of cutter load is determined by structure and motion mode of the cone. 3) Impact and scraping proportion of cutter with different bits structures is different, resulting in different rock breaking modes of cutter with different cutter row. This research has a profound understanding of the influence of cone shape on cutter load and cutter failure of bit, and it is of great significance for the study of composite cone single cone bit with long service life and high rock breaking efficiency.

Predicting Failure Distributions of SRAM Arrays by Using Extreme Value Statistic, Bit Cell Simulation, and Machine Learning

We present a successful methodology for accurately predicting failure distributions of SRAM arrays based on simulation results of a single bit cell. This was achieved by using extreme value statistic and a data-centric approach of supervised machine learning. The purpose of such predictions is to enable assessments of the trade-off between optimizing power, performance, and area (PPA) and safeguarding reliability in an early phase of development.

Radiation hardened 11T memory cell for space applications

Continuous nanometer technology scaling, along with rapid growth in the field of artificial intelligence (AI), internet-of-things (IoT), and other high-performance computing applications increases the need for low power and soft error immune VLSI circuits. Conventional radiation hardened bit cell such as QUATRO10T with partial single event upset (SEU) immunity and bit cells such as DICE12T, WE-QUATRO12T, and RHD13T needs large area and power consumption. To address these problems, a soft error immune radiation hardened memory cell 11T (RHMC11T) static random-access memory (SRAM) bit cell is proposed which is immune to both SEU and single event multiple node upsets (SEMNU) along with good read and write stability. The enhancement in the key parameters of the proposed cell is confirmed by comparing the proposed bit cell with the conventional bit cells such as 6T, NS10T, PS10T, QUATRO10T, RHMD10T, RHBD10T, 11T, and 12T. The critical charge of the proposed RHMC11T is improved by 43%, 27%, 19%, 2%, 2%, and 4% while comparing with 6T, NS10T, PS10T, QUATRO10T, RHBD10T, and 11T. The proposed bit cell has higher SVNM of 49%, 19%, 11%, 8%, and 5% and smaller WTV of 50%, 33%, 23%, 18%, and 21% compared to 6T, PS10T, RHMD10T, RHBD10T, and 12T respectively. The proposed RHMC11T has lesser read access time of 63%, 50%, 46%, 6%, and 6% compared to NS10T, PS10T, QUATRO10T, RHMD10T, and 11T. The proposed RHMC11T bit cell with dedicated write and read word lines makes it applicable for bit interleaving architecture and also it satisfies reliability requirements making it a good choice for highly radiative terrestrial environment applications such as in aerospace and satellites.

Numerical Simulation and Field Test of a PDC Bit with Mixed Cutter Arrangement to Break Non-Homogeneous Granite

As the depth of petroleum drilling increases, the strata environment becomes more complex. The efficiency and lifespan of Polycrystalline Diamond Compact (PDC) drill bits fail to meet current drilling demands. However, the structure and arrangement of PDC cutters are valuable determinants of drilling efficiency, although related research still has gaps and deficiencies. This study focuses on PDC cutters in axe, triangular prism, and circular forms. It establishes an inhomogeneous granite model based on the actual measurements of granite and verifies the accuracy of this model through uniaxial compression simulation. Finite element models of three types of cutters in various combination schemes are constructed to examine rock-breaking effects, with the best scheme optimized using Box-Behnken response surface methodology. The rock-breaking process of the optimal PDC drill bit layout has been compared to that of a single cutter bit. Field drilling has demonstrated the effectiveness of a mixed cutter arrangement. The results show that the inhomogeneous granite model can be trusted. The optimal arrangement involves axe cutters in the front row and an alternate arrangement of triangular prism cutters and axe cutters in the back row. The optimal lateral and longitudinal distances for the triangular cutters from the front row of axe cutters are 10 mm and 7 mm, respectively, while those for the back row of axe cutters from the front row are 10.06 mm and 7 mm, respectively. The ROP standard deviation in the drilling process of mixed cutter bits decreases by 53.06% and 43.08% compared to axe and triangular prism cutter bits, respectively. The drilling efficiency increases by 16.8% and 16.6%, respectively, demonstrating higher efficiency and stability. Field drilling results indicate that a mixed cutter bit increases efficiency by 23.5% compared to a bit with only triangular prism cutters. This study posits that research on the combination schemes and parameters of PDC cutters can significantly enhance drilling efficiency, thereby reducing the drilling cycle and costs.

A Modified 2D-Checksum Error Detecting Method for Data Transmission in Noisy Media

In data transmission a change in single bit in the received data may lead to miss understanding or a disaster. Each bit in the sent information has high priority especially with information such as the address of the receiver. The importance of error detection with each single change is a key issue in data transmission field.The ordinary single parity detection method can detect odd number of errors efficiently, but fails with even number of errors. Other detection methods such as two-dimensional and checksum showed better results and failed to cope with the increasing number of errors.Two novel methods were suggested to detect the binary bit change errors when transmitting data in a noisy media.Those methods were: 2D-Checksum method and Modified 2D-Checksum. In 2D-checksum method, summing process was done for 7×7 patterns in row direction and then in column direction to result 8×8 patterns. While in modified method, an additional parity diagonal vector was added to the pattern to be 8×9. By combining the benefits of using single parity (detecting odd number of error bits) and the benefits of checksum (reducing the effect of 4-bit errors) and combining them in 2D shape, the detection process was improved. By contaminating any sample of data with up to 33% of noise (change 0 to 1 and vice versa), the detecting process in first method was improved by approximately 50% compared to the ordinary traditional two dimensional-parity method and gives best detection results in second novel method

Composably secure device-independent encryption with certified deletion

We study the task of encryption with certified deletion (ECD) introduced by Broadbent and Islam (2020), but in a device-independent setting: we show that it is possible to achieve this task even when the honest parties do not trust their quantum devices. Moreover, we define security for the ECD task in a composable manner and show that our ECD protocol satisfies conditions that lead to composable security. Our protocol is based on device-independent quantum key distribution (DIQKD), and in particular the parallel DIQKD protocol based on the magic square non-local game, given by Jain, Miller and Shi (2020). To achieve certified deletion, we use a property of the magic square game observed by Fu and Miller (2018), namely that a two-round variant of the game can be used to certify deletion of a single random bit. In order to achieve certified deletion security for arbitrarily long messages from this property, we prove a parallel repetition theorem for two-round non-local games, which may be of independent interest.

A generalization of Bernstein–Vazirani algorithm with multiple secret keys and a probabilistic oracle

A probabilistic version of the Bernstein-Vazirani problem (which is a generalization of the original Bernstein-Vazirani problem) and a quantum algorithm to solve it are proposed. The problem involves finding one or more secret keys from a set of multiple secret keys (encoded in binary form) using a quantum oracle. From a set of multiple unknown keys, the proposed quantum algorithm is capable of (a) obtaining any key (with certainty) using a single query to the probabilistic oracle and (b) finding all keys with a high probability (approaching 1 in the limiting case). In contrast, a classical algorithm will be unable to find even a single bit of a secret key with certainty (in the general case). Owing to the probabilistic nature of the oracle, a classical algorithm can only be useful in obtaining limiting probability distributions of $ 0 $ and $ 1 $ for each bit-position of secret keys (based on multiple oracle calls) and this information can further be used to infer some estimates on the distribution of secret keys based on combinatorial considerations. For comparison, it is worth noting that a classical algorithm can be used to exactly solve the original Bernstein-Vazirani problem (involving a deterministic oracle and a single hidden key containing $n$ bits) with a query complexity of $\mathcal{O}(n)$. An interesting class of problems similar to the probabilistic version of the Bernstein-Vazirani problem can be construed, where quantum algorithms can provide efficient solutions with certainty or with a high degree of confidence and classical algorithms would fail to do so.

A 24-kHz BW 90.5-dB SNDR 96-dB DR continuous-time delta-sigma modulator using FIR DAC feedback

This paper presents a single bit continuous time delta-sigma modulator (CTDSM) with finite impulse response (FIR) feedback DAC designed for audio applications. By using FIR feedback in the input stage, the linearity requirements of the first integrator are relaxed, and the clock jitter sensitivity is reduced, as seen in a multi-bit quantizers. The choppers, working in conjunction with the FIR DAC, effectively suppresses in-band aliasing noise generated by the chopper in the first integrator. A fast comparator serves as a single-bit quantizer, and the 9.2% TS loop delay eliminates the need for excess loop delay compensation in the modulator. Energy efficient integrators are implemented using the current-starved OTA. The CTDSM prototype was fabricated using a 180-nm CMOS process, achieving a 90.5 dB SNDR and 96 dB DR with a 24 kHz signal bandwidth. The power consumption is 210 μ W, corresponding to a Schreier figure-of-merit value of 171.1 dB.

A secure framework for medical image by integrating watermarking and encryption through fuzzy based ROI selection

Security, secrecy, and authenticity problems have arisen as a result of the widespread sharing of medical images in social media. Copyright protection for online photo sharing is becoming a must. In this research, a cutting-edge method for embedding encrypted watermarks into medical images is proposed. The proposed method makes use of fuzzy-based ROI selection and wavelet-transformation to accomplish this. In the first step of the process, a fuzzy search is performed on the original picture to locate relevant places using the center region of interest (RoI) and the radial line along the final intensity. The suggested method takes a digital picture and divides it into 4×4 non-overlapping blocks, with the intent of selecting low information chunks for embedding in order to maximize invisibility. By changing the coefficients, a single watermark bit may be inserted into both the left and right singular SVD matrices. The absence of false positives means the suggested technique can successfully integrate a large amount of data. Watermarks are encrypted using a pseudorandom key before being embedded. Discrete wavelet transform saliency map, block mean method, and cosine functions are used to construct an adaptively-generated pseudo-random key from the cover picture. Images uploaded to social media platforms must have a high degree of invisibility and durability. These watermarking features, however, come with a price. The optimal scaling factor is used to strike a balance between the two in the proposed system. Furthermore, the suggested scheme’s higher performance is confirmed by comparison with the latest state-of-the-art systems.

Concurring of Neural Machines for Robust Session Key Generation and Validation in Telecare Health System During COVID-19 Pandemic.

In this technique, it has been proposed to agree the session keys that have been generated through dual artificial neural networks based on the Telecare Health COVID-19 domain. Electronic health enables secure and protected communication between the patients and physicians, especially during this COVID-19 pandemic. Telecare was the main component which served the remote and non-invasive patients in the crisis period of COVID-19. Neural cryptographic engineering support in terms of data security and privacy is the main theme for Tree Parity Machine (TPM) synchronization in this paper. The session key has been generated on different key lengths and key validation done on the proposed set of robust session keys. A neural TPM network receives a vector designed through same random seed and producing a single output bit. Duo neural TPM networks' intermediate keys would be partially shared between the patient and doctor for the purpose neural synchronization. Higher magnitude of co-existence has been observed at the duo neural networks at the Telecare Health Systems in COVID-19. This proposed technique has been highly protective against several data attacks in the public networks. Partial transmission of the session key disables the intruders to guess the exact pattern, and highly randomized through different tests. The average p-values of different session key lengths of 40 bits, 60 bits, 160 bits, and 256 bits were observed to be 221.9, 259.3, 242, and 262.8 (taken under multiplicative of 1000) respectively.

Method for copyright protection of deep neural networks using digital watermarking

The article proposes a new method of copyright protection for deep neural networks. The main idea of the method is to embed digital watermarks into the protected model by retraining it on a unique set of pseudo-holographic images (pseudo-holograms). A pseudo-hologram is a two-dimensional sinusoidal signal that encodes a binary sequence of arbitrary length. By changing the phase of each sinusoid, it is possible to form various pseudo-hologram images based on a single bit sequence. The proposed approach to embedding is to generate a training sample in such a way that pseudo-holograms formed on the basis of one sequence fall into the same class. In this case, each class will correspond to different bit sequences. Verification of the digital watermark is carried out by applying various pseudo-holograms to the input of the model and checking whether the hidden sequence corresponds to a certain class. Experimental studies confirm the efficiency of the method and its compliance with all quality criteria established for the methods of neural network watermarking.

Multi-key Fully Homomorphic Encryption without CRS from RLWE

Fully Homomorphic Encryption (FHE) is a powerful encryption system in cloud computing that allows homomorphic computations on encrypted data without decrypting them. Multi-key fully homomorphic encryption (MFHE), as an extension to FHE, allows homomorphic computations on ciphertexts encrypted under different keys. However, most MFHE schemes require a Common Random/Reference String (CRS), while the few that do not are based on the Learning With Errors (LWE) problem, which means that they can only deal with single bit plaintext. Consequently, MFHE schemes based on the Ring Learning With Errors (RLWE) problem are more desirable, as they can handle polynomial plaintext. Requiring the CRS seems to weaken the semantic definition of MFHE, where all users generate their own keys independently. In this paper, we study the RLWE-based MFHE in the CRS model and propose the first RLWE-based MFHE without a CRS. To this end, we remove the CRS by designing a relinearization algorithm without a CRS. Like previous MFHE schemes, our RLWE-based MFHE without CRS has a simple 1-round threshold decryption, which implies a 3-round secure MPC protocol in the plain model from the RLWE assumption.

Pushing the Limits of Generic Side-Channel Attacks on LWE-based KEMs - Parallel PC Oracle Attacks on Kyber KEM and Beyond

In this work, we propose generic and novel adaptations to the binary Plaintext-Checking (PC) oracle based side-channel attacks for Kyber KEM. These attacks operate in a chosen-ciphertext setting, and are fairly generic and easy to mount on a given target, as the attacker requires very minimal information about the target device. However, these attacks have an inherent disadvantage of requiring a few thousand traces to perform full key recovery. This is due to the fact that these attacks typically work by recovering a single bit of information about the secret key per query/trace. In this respect, we propose novel parallel PC oracle based side-channel attacks, which are capable of recovering a generic P number of bits of information about the secret key in a single query/trace. We propose novel techniques to build chosen-ciphertexts so as to efficiently realize a parallel PC oracle for Kyber KEM. We also build a multi-class classifier, which is capable of realizing a practical side-channel based parallel PC oracle with very high success rate. We experimentally validated the proposed attacks (upto P = 10) on the fastest implementation of unprotected Kyber KEM in the pqm4 library. Our experiments yielded improvements in the range of 2.89× and 7.65× in the number of queries, compared to state-of-the-art binary PC oracle attacks, while arbitrarily higher improvements are possible for a motivated attacker, given the generic nature of the proposed attacks. We further conduct a thorough study on applicability to different scenarios, based on the presence/absence of a clone device, and also partial key recovery. Finally, we also show that the proposed attacks are able to achieve the lowest number of queries for key recovery, even for implementations protected with low-cost countermeasures such as shuffling. Our work therefore, concretely demonstrates the power of PC oracle attacks on Kyber KEM, thereby stressing the need for concrete countermeasures such as masking for Kyber and other lattice-based KEMs.

On Protecting SPHINCS+ Against Fault Attacks

SPHINCS+ is a hash-based digital signature scheme that was selected by NIST in their post-quantum cryptography standardization process. The establishment of a universal forgery on the seminal scheme SPHINCS was shown to be feasible in practice by injecting a fault when the signing device constructs any non-top subtree. Ever since the attack has been made public, little effort was spent to protect the SPHINCS family against attacks by faults. This paper works in this direction in the context of SPHINCS+ and analyzes the current algorithms that aim to prevent fault-based forgeries.First, the paper adapts the original attack to SPHINCS+ reinforced with randomized signing and extends the applicability of the attack to any combination of faulty and valid signatures. Considering the adaptation, the paper then presents a thorough analysis of the attack. In particular, the analysis shows that, with high probability, the security guarantees of SPHINCS+ significantly drop when a single random bit flip occurs anywhere in the signing procedure and that the resulting faulty signature cannot be detected with the verification procedure. The paper shows both in theory and experimentally that the countermeasures based on caching the intermediate W-OTS+s offer a marginally greater protection against unintentional faults, and that such countermeasures are circumvented with a tolerable number of queries in an active attack. Based on these results, the paper recommends real-world deployments of SPHINCS+ to implement redundancy checks.