Demonstration of Three True Random Number Generator Circuits Using Memristor Created Entropy and Commercial Off-the-Shelf Components.
Ontology highlight
ABSTRACT:
SUBMITTER: Stoller S
PROVIDER: S-EPMC8003698 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:The intrinsic variability of switching behavior in memristors has been a major obstacle to their adoption as the next generation of universal memory. On the other hand, this natural stochasticity can be valuable for hardware security applications. Here we propose and demonstrate a novel true random number generator utilizing the stochastic delay time of threshold switching in a Ag:SiO2 diffusive memristor, which exhibits evident advantages in scalability, circuit complexity, and power consumption. The random bits generated by the diffusive memristor true random number generator pass all 15 NIST randomness tests without any post-processing, a first for memristive-switching true random number generators. Based on nanoparticle dynamic simulation and analytical estimates, we attribute the stochasticity in delay time to the probabilistic process by which Ag particles detach from a Ag reservoir. This work paves the way for memristors in hardware security applications for the era of the Internet of Things.Memristors can switch between high and low electrical-resistance states, but the switching behaviour can be unpredictable. Here, the authors harness this unpredictability to develop a memristor-based true random number generator that uses the stochastic delay time of threshold switching.
| S-EPMC5638922 | biostudies-literature
Project description:The intrinsic stochasticity of the memristor can be used to generate true random numbers, essential for non-decryptable hardware-based security devices. Here, we propose a novel and advanced method to generate true random numbers utilizing the stochastic oscillation behavior of a NbOx mott memristor, exhibiting self-clocking, fast and variation tolerant characteristics. The random number generation rate of the device can be at least 40 kb s-1, which is the fastest record compared with previous volatile memristor-based TRNG devices. Also, its dimensionless operating principle provides high tolerance against both ambient temperature variation and device-to-device variation, enabling robust security hardware applicable in harsh environments.
| S-EPMC8131590 | biostudies-literature
Project description:The future security of Internet of Things is a key concern in the cyber-security field. One of the key issues is the ability to generate random numbers with strict power and area constrains. "True Random Number Generators" have been presented as a potential solution to this problem but improvements in output bit rate, power consumption, and design complexity must be made. In this work we present a novel and experimentally verified "True Random Number Generator" that uses exclusively conventional CMOS technology as well as offering key improvements over previous designs in complexity, output bitrate, and power consumption. It uses the inherent randomness of telegraph noise in the channel current of a single CMOS transistor as an entropy source. For the first time multi-level and abnormal telegraph noise can be utilised, which greatly reduces device selectivity and offers much greater bitrates. The design is verified using a breadboard and FPGA proof of concept circuit and passes all 15 of the NIST randomness tests without any need for post-processing of the generated bitstream. The design also shows resilience against machine learning attacks performed by the LSTM neural network.
| S-EPMC7560754 | biostudies-literature
Project description:The volume of securely encrypted data transmission increases continuously in modern society with all things connected. Towards this end, true random numbers generated from physical sources are highly required for guaranteeing security of encryption and decryption schemes for exchanging sensitive information. However, majority of true random number generators (TRNGs) are mechanically rigid, and thus cannot be compatibly integrated with some specific flexible platforms. Herein, we present a flexible and stretchable bionic TRNG inspired by the uniqueness and randomness of biological architectures. The flexible TRNG film is molded from the surface microstructures of natural plants (e.g., ginkgo leaf) via a simple, low-cost, and environmentally friendly manufacturing process. In our proof-of-principle experiment, the TRNG exhibits a fast generation speed of up to 1.04 Gbit/s, in which random numbers are fully extracted from laser speckle patterns with a high extraction rate of 72%. Significantly, the resulting random bit streams successfully pass all randomness test suites including NIST, TestU01, and DIEHARDER. Even after 10,000 times cyclic stretching or bending tests, or during temperature shock (-25-80 °C), the bionic TRNG still reveals robust mechanical reliability and thermal stability. Such a flexible TRNG shows a promising potential in information security of emerging flexible networked electronics.Electronic supplementary materialSupplementary material (light path diagram of transmitted laser speckle, pseudo random pattern, statistical distribution of bionic microstructures, haze of the bionic TRNG film, multi-layer circular laser intensity pattern, percentage of bit 0/1 for different hashed images, Pearson correlation coefficient between 100 different speckle images, the whole process of randomness extraction, SEM images of the flexible TRNG film after 10,000 times stretching and bending, continuous work stability of the TRNG at low or high temperature, light path diagram of reflective laser speckle, and detailed randomness test results of NIST, TestU01, and DIEHARDER) is available in the online version of this article at 10.1007/s12274-022-4109-9.
| S-EPMC8902273 | biostudies-literature
Project description:We design a cryptographic transistor (cryptoristor)-based true random number generator (tRNG) with low power consumption and small footprint. This is the first attempt to use irregular and unpredictable operation-induced randomness of a cryptoristor as an entropy source. To extract discrete random numbers with a binary code from the cryptoristor, we developed a noise-coupling analog-to-digital converter. This converter not only converts analog signals to digital random bits but also improves the randomness of the entropy source with low power consumption. The randomness of the cryptoristor is attributed to the random carrier multiplications with the creation and stochastic carrier escape as destruction, which occurs iteratively as long as the input current is fed. The cryptoristor-based tRNG passed 15 randomness test suites of NIST Special Publication 800-22. It is robust to iterative operational stresses and to ambient temperature changes, making it an attractive option for hardware-based security solutions in the Internet of Things due to its low power consumption and small size.
| S-EPMC10889348 | biostudies-literature
Project description:A wind-driven triboelectric nanogenerator (W-TENG) is a promising energy harvesting device due to its clean, ubiquitous and unexhausted properties. In addition, a W-TENG induces unpredictable chaotic outputs from wind flow that can serve as an entropy source for cryptography. This can be applied to a true random number generator (TRNG) for a secured system due to its inherent turbulent nature; thus, a W-TENG with a two-in-one structure can simultaneously generate both power and true random numbers. However, a previously reported W-TENG had one major drawback: a wind velocity of 10 m/s is required for stable energy harvesting by wind force. Thus, it is timely to demonstrate a W-TENG-based RNG whose operating condition is below 3 m/s, which is a gentle breeze similar to natural wind. In this study, we demonstrate a wind-driven cryptographic triboelectric random number generator (WCT-RNG) by using a W-TENG whose operating condition for wind speed is below 3 m/s by adopting a rear-fixed film structure instead of a conventional structure. The rear-fixed film refers to the fluttering film being freestanding on the front-side and fixed on the rear-side, where the front- and rear-sides are the wind inlet and outlet, respectively. The WCT-RNG enables the W-TENG to operate below a 3 m/s wind velocity. Because of this, the working time of the WCT-RNG is dramatically enhanced from only 8-42% at an average altitude above sea level. As the capability of operating at low wind speeds is significantly improved, a WCT-RNG becomes more useful and practical for generating both power and true random numbers in a single device. The device can thereby lead to the construction of a self-powered TRNG and secure communication for Internet of Things (IoT) devices in various environments, even under a gentle breeze. In this study, we explain the design of a WCT-RNG structure and also evaluate its randomness by using an NIST SP 800-22 B test suite with a reliability test.
| S-EPMC10791744 | biostudies-literature
Project description:We present five novel or modified circuits intended for building a universal computer based on random pulse computing (RPC) paradigm, a biologically-inspired way of computation in which variable is represented by a frequency of a random pulse train (RPT) rather than by a logic state. For the first time we investigate operation of RPC circuits from the point of entropy. In particular, we introduce entropy budget criterion (EBC) to reliably predict whether it is even possible to create a deterministic circuit for a given mathematical operation and show its relevance to numerical precision of calculations. Based on insights gained from the EBC, unlike in the previous art, where randomness is obtained from electronics noise or a pseudorandom shift register while processing circuitry is deterministic, in our approach both variable generation and signal processing rely on the random flip-flop (RFF) whose randomness is derived from a fundamentally random quantum process. This approach offers an advantage in higher precision, better randomness of the output and conceptual simplicity of circuits.
| S-EPMC8741937 | biostudies-literature
Project description:Schizophrenia is a multifaceted chronic psychiatric disorder that affects the way a human thinks, feels, and behaves. Inevitably, natural randomness exists in the psychological perception of schizophrenic patients, which is our primary source of inspiration for this research because true randomness is the indubitably ultimate valuable resource for symmetric cryptography. Famous information theorist Claude Shannon gave two desirable properties that a strong encryption algorithm should have, which are confusion and diffusion in his fundamental article on the theoretical foundations of cryptography. Block encryption strength against various cryptanalysis attacks is purely dependent on its confusion property, which is gained through the confusion component. In the literature, chaos and algebraic techniques are extensively used to design the confusion component. Chaos- and algebraic-based techniques provide favorable features for the design of the confusion component; however, researchers have also identified potential attacks on these techniques. Instead of existing schemes, we introduce a novel methodology to construct cryptographic confusion component from the natural randomness, which are existing in the psychological perception of the schizophrenic patients, and as a result, cryptanalysis of chaos and algebraic techniques are not applicable on our proposed technique. The psychological perception of the brain regions was captured through the electroencephalogram (EEG) readings during the sensory task. The proposed design passed all the standard evaluation criteria and validation tests of the confusion component and the random number generators. One million true random bits are assessed through the NIST statistical test suite, and the results proved that the psychological perception of schizophrenic patients is a good source of true randomness. Furthermore, the proposed confusion component attains better or equal cryptographic strength as compared to state-of-the-art techniques (2020 to 2021). To the best of our knowledge, this nature of research is performed for the first time, in which psychiatric disorder is utilized for the design of information security primitive. This research opens up new avenues in cryptographic primitive design through the fusion of computing, neuroscience, and mathematics.
| S-EPMC9239775 | biostudies-literature
Project description:In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.
| S-EPMC4740897 | biostudies-literature
Project description:Some aspects of real-world road networks seem to have an approximate scale invariance property, motivating study of mathematical models of random networks whose distributions are exactly invariant under Euclidean scaling. This requires working in the continuum plane, so making a precise definition is not trivial. We introduce an axiomatization of a class of processes we call scale-invariant random spatial networks, whose primitives are routes between each pair of points in the plane. One concrete model, based on minimum-time routes in a binary hierarchy of roads with different speed limits, has been shown to satisfy the axioms, and two other constructions (based on Poisson line processes and on dynamic proximity graphs) are expected also to do so. We initiate study of structure theory and summary statistics for general processes in the class. Many questions arise in this setting via analogies with diverse existing topics, from geodesics in first-passage percolation to transit node-based route-finding algorithms.
| S-EPMC3670310 | biostudies-literature