The security of modern cryptographic applications depends on the quality of their random number generators (RNGs). While physical true random number generators (PTRNGs) provide high-quality randomness, their performance is often insufficient for high-throughput applications. On the other hand, deterministic random number generators (DRNGs) offer better speed but lack true randomness. This paper presents an approach to developing a high-performance PTRNG. The research focuses on optimizing the digitization of analog noise signals. For this purpose, an ADC was selected that can digitize analog signals at a high clock rate. The functionality of the ADC could be verified by digitizing reference signals. Preliminary results by digitizing the analog noise signal demonstrates the feasibility of the proposed approach, but highlight challenges in achieving good results for Min-Entropy.
The security of modern cryptographic applications depends on the quality of their random number generators (RNGs). While physical true random number generators (PTRNGs) provide high-quality randomness, their performance is often insufficient for high-throughput applications. On the other hand, deterministic random number generators (DRNGs) offer better speed but lack true randomness. This paper presents an approach to developing a high-performance PTRNG. The research focuses on optimizing the digitization of analog noise signals. For this purpose, an ADC was selected that can digitize analog signals at a high clock rate. The functionality of the ADC could be verified by digitizing reference signals. Preliminary results by digitizing the analog noise signal demonstrates the feasibility of the proposed approach, but highlight challenges in achieving good results for Min-Entropy.
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research, etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a RNG. Randomness of a RNG can be precisely, scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG (True RNG - TRNG) which, at state of the art, seem to be possible only by use of physical randomness inherent to certain (simple) quantum systems. On the other hand, current industry standard dictates use of RNG's based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which cannot be strictly proven. This approach is currently used in 3-rd and 4-th generation FPGA and ASIC hardware, unsuitable for realization of quantum TRNG. We compare weak and strong aspects of the two approaches and discuss possibility of building quantum TRNG in the recently appeared Mixed Signal FPGA technology. Finally, we discuss several examples where use of a TRNG is critical and show how it can significantly improve security of cryptographic systems.
A quantum random number generator (QRNG) provides a reliable means for the generation of true random numbers. The inherent randomness of the vacuum fluctuations makes the quantum vacuum state a superior source of entropy. However, in practice, the raw sequences of QRNG are inevitably contaminated by classical technical noise, which compromises the security of the QRNG. Min-entropy conditioned on the classical noise is a useful method that can quantify the side-information independent randomness. To improve the extractable randomness from the raw sequences arising from the quantum vacuum-based QRNG, we propose and experimentally demonstrate two approaches, discarding-boundary-bin measurement and multi-interval sampling. The first one increases the conditional min-entropy at a low quantum-to-classical-noise ratio. The latter exploits parallel sampling using multiple analog-to-digital converters (ADCs) and effectively overcomes the finite resolution limit and uniform sampling of a single ADC. The maximum average conditional min-entropy can reach 9.2 per sample when combining these two approaches together in contrast to 6.93 with a single 8-bit ADC.
High-speed true random number generator is a building block in the modern information security system. We propose and demonstrate an efficient high-speed true random number generator based on multiple parallel self-timed rings (STRs). To improve the security, we evaluate the randomness of the entropy source by min-entropy and exploit the information-theoretically provable Toeplitz-hashing extractor. To minimize the consumption of hardware resources of a field programmable gate array at a predetermined high throughput and maximize the throughput with the limited hardware resources, we systematically derive and investigate the dependence of the data throughput and the total consumed resources of the random number generator on the system parameters. On this basis, we make a joint optimization for the degree of parallelism of the STRs and the extraction efficiency of the extractor. A 10-Gbps true random number generator is implemented efficiently, so that the output random bits can pass all the National Institute of Standards and Technology (NIST) and Dieharder test suites.
A comprehensive performance analysis of a TRNG system that is based on beat frequency is provided in this paper for secure, high-entropy applications. The proposed method generates unpredictable bit streams by leveraging the intrinsic unpredictability caused by the frequency difference between two distinct oscillators. The system employs phase noise and variations in the surrounding environment to increase entropy without the need for laborious post-processing procedures. The study evaluates statistical variance using well-known test suites such as the NIST and Diehard tests to ensure high-quality output. The entropy rate, stability, power consumption, and throughput are among the critical performance metrics that are pertinent. The experimental data firmly refutes exogenous influences and deterministic patterns.
Random numbers generated via quantum process is indeterministic, which are of essential to the cryptographic communication and the large-scale computer modeling. However, in realistic scenarios, classical noises can inevitably contaminate the raw sequences of a quantum randomness number generator (QRNG), and then compromise the security of the QRNG. Min-entropy is a useful approach that can quantify the randomness independent of side-information. To enhance the extractable randomness of the raw sequences arising from the QRNG, we propose a new method which exploits non-uniform quantization methods instead of uniform sampling methods and effectively enhances the extractable randomness from the QRNG at a high quantum-to-classical-noise ratio (QCNR). Given a QCNR as 50 dB and a 16-bit analog-to-digital converter (ADC), the worst-case conditional min-entropy of the non-uniform quantization scheme is improved by nearly 11% compared with that of the uniform sampling scheme.
With a growing interest in securing user data within the internet-of-things (IoT), embedded encryption has become of paramount importance, requiring light-weight high-quality Random Number Generators (RNGs). Emerging stochastic device technologies produce random numbers from stochastic physical processes at high quality, however, their generated random number streams are adversely affected by process and supply voltage variations, which can lead to bias in the generated streams. In this work, we present an adaptive variation-resilient RNG capable of extracting unbiased encryption-grade random number streams from physically driven entropy sources, for embedded cryptography applications. The system's key feature is its adaptive digitizer with an adaptive reference voltage. As a proof of concept, we employ a stochastic magnetic tunnel junction (sMTJ) device as an entropy source. The impact of variations in the sMTJ is mitigated by the adaptive digitizer, which generates an adaptive short-term average reference voltage that dynamically tracks any stochastic signal drift or deviation, leading to unbiased random bit stream generation. The generated bit streams, due to their higher entropy, then only need to undergo simplified post-processing. A prototype of the adaptive RNG system was experimentally implemented using discrete electronic components and an FPGA for entropy source emulation. Statistical randomness tests based on the National Institute of Standards and Technology (NIST) test suite are conducted on bit streams obtained using the simulations as well as the discrete electronic component implementation, demonstrating that the bit streams consistently pass all 16 tests of the NIST SP 800-22 test suite with a 100% pass rate. Leveraging its simplified post-processing, the adaptive RNG shows consistent operation across a wide range of throughputs from 5 to 182 Mbps.