Enhanced security for multi-detector quantum random number generators

Random numbers are at the heart of diverse fields, ranging from simulations of stochastic processes to classical and quantum cryptography. The requirement for true randomness in these applications has motivated various proposals for generating random numbers based on the inherent randomness of quantum systems. The generation of true random numbers with arbitrarily defined probability distributions is highly desirable for applications, but it is very challenging. Here we show that single-photon quantum walks can generate multi-bit random numbers with on-demand probability distributions, when the required “coin” parameters are found with the gradient descent (GD) algorithm. Our theoretical and experimental results exhibit high fidelity for various selected distributions. This GD-enhanced single-photon system provides a convenient way for building flexible and reliable quantum random number generators. Multi-bit random numbers are a necessary resource for high-dimensional quantum key distribution.

Random numbers are a fundamental resource in science and engineering, and are also widely used in many fields, such as simulation, cryptography, lotteries, fundamental science. There are algorithmically generated numbers that look like random numbers but are not truly random. These pseudo random numbers are generated from a computer, using deterministic algorithms. Because, we cannot use pseudo random generators in situations, where true randomness is necessary, we use true random number generators. In this case, we use unpredictable random events as a random source. Quantum random number generators (QRNG) output true random numbers based on inherent randomness in quantum measurements. Our goal is to generate fast random numbers at a lower cost. At the same time, a high level of randomness is essential. We present the improved novel quantum random number generator, which is based the on time of arrival QRNG. It is rather efficient, as it uses the simple version of the detectors with rather few requirements. The novel QRNG produces more than one random bit per each photon detection.

Quantum entanglement represents an ideal resource to guarantee the security of random numbers employed in many scientific and cryptographic applications. However, entanglement-based certified random number generators are particularly challenging to implement. Here, we demonstrate a certified quantum random number generator based on momentum-polarization entangled single-photon states. The use of single-photon entanglement allows an attenuated laser source to be employed and a simple setup where only linear optical components are utilized. For the latter, a semi-device-independent modeling of the photonic quantum random number generator is developed, which certifies a minimum entropy of $(2.5\ifmmode\pm\else\textpm\fi{}0.5)\mathrm{%}$, corresponding to a generation rate of 4.4 kHz. At the expenses of a higher level of trust in the system, the certified minimum entropy can be increased to $(30.1\ifmmode\pm\else\textpm\fi{}0.5)\mathrm{%}$, implying a generation rate of 52.7 kHz. Our results show that a simple optical implementation combined with an accurate modeling provide an entanglement-based high-security quantum random number generator using imperfect devices.

Random numbers are widely employed in cryptography and security applications. If the generation process is weak, the whole chain of security can be compromised: these weaknesses could be exploited by an attacker to retrieve the information, breaking even the most robust implementation of a cipher. Due to their intrinsic close relationship with analogue parameters of the circuit, True Random Number Generators are usually tailored on specific silicon technology and are not easily scalable on programmable hardware, without affecting their entropy. On the other hand, programmable hardware and programmable System on Chip are gaining large adoption rate, also in security critical application, where high quality random number generation is mandatory. The work presented herein describes the design and the validation of a digital True Random Number Generator for cryptographically secure applications on Field Programmable Gate Array. After a preliminary study of literature and standards specifying requirements for random number generation, the design flow is illustrated, from specifications definition to the synthesis phase. Several solutions have been studied to assess their performances on a Field Programmable Gate Array device, with the aim to select the highest performance architecture. The proposed designs have been tested and validated, employing official test suites released by NIST standardization body, assessing the independence from the place and route and the randomness degree of the generated output. An architecture derived from the Fibonacci-Galois Ring Oscillator has been selected and synthesized on Intel Stratix IV, supporting throughput up to 400 Mbps. The achieved entropy in the best configuration is greater than 0.995.

A true random number generator (TRNG) is suitable for generating secure keys and nonces. TRNGs implemented in IoT devices must be small in scale and have low power consumption. The random number sequence generated by TRNG needs to have high entropy immediately after startup and a stable state. In this paper, three types of ring oscillator type TRNGs, TERO-based, COSO-based, and STR-based TRNG, are implemented on Zynq-7010. When these TRNGs are implemented as a single entropy source, it is challenging to implement them because it is necessary to evaluate the layout and wiring for each FPGA. This paper proposes a TRNG configuration, which exclusively ORs the outputs of multiple entropy sources. We show that this configuration can reduce the implementing difficulty and realize high entropy. For the random number sequence evaluation, we use the statistical test of NIST SP800-90B and BSI AIS 20/31. In addition, the random number sequence immediately after the startup is also statistically evaluated. As a result, our proposed TRNGs generate high entropy random numbers and are easy to implement on FPGA when we implement TRNGs with eight single entropy sources for TERO-based TRNG, 48 for COSO-based TRNG, and two for STR-based TRNG, respectively.

Printed electronics (PE) is a fast-growing field with promising applications in wearables, smart sensors, and smart cards, since it provides mechanical flexibility, and low-cost, on-demand, and customizable fabrication. To secure the operation of these applications, true random number generators (TRNGs) are required to generate unpredictable bits for cryptographic functions and padding. However, since the additive fabrication process of the PE circuits results in high intrinsic variations due to the random dispersion of the printed inks on the substrate, constructing a printed TRNG is challenging. In this article, we exploit the additive customizable fabrication feature of inkjet printing to design a TRNG based on electrolyte-gated field-effect transistors (EGFETs). We also propose a printed resistor tuning flow for the TRNG circuit to mitigate the overall process variation of the TRNG so that the generated bits are mostly based on the random noise in the circuit, providing a true random behavior. The simulation results show that the overall process variation of the TRNGs is mitigated by 110 times, and the generated bitstream of the tuned TRNGs passes the National Institute of Standards and Technology - Statistical Test Suite. For the proof of concept, the proposed TRNG circuit was fabricated and tuned. The characterization results of the tuned TRNGs prove that the TRNGs generate random bitstreams at the supply voltage of down to 0.5 V. Hence, the proposed TRNG design is suitable to secure low-power applications in this domain.

Quantum random numbers play a crucial role in diverse applications, including cryptography, simulation, and artificial intelligence. In contrast to predictable algorithm-based pseudo-random numbers, quantum physics provides new avenues for generating theoretically true random numbers by exploiting the inherent uncertainty contained in quantum phenomena. Here, we propose and demonstrate a quantum random number generator (QRNG) using a prepared broadband squeezed state of light, where the randomness of the generated numbers entirely originates from the quantum noise introduced by squeezing operation rather than vacuum noise. The relationship between entropy rate and squeezing level is analyzed. Furthermore, we employ a source-independent quantum random number protocol to enhance the security of the random number generator.

We demonstrate a 6 Gbps real-time optical quantum random number generator by measuring vacuum fluctuation. To address the common problem that speed gap exists between fast randomness generation and slow randomness extraction in most high-speed real-time quantum random number generator systems, we present an optimized extraction algorithm based on parallel implementation of Toeplitz hashing to reduce the influence of classical noise due to the imperfection of devices. Notably, the real-time rate of randomness extraction we have achieved reaches the highest speed of 12 Gbps by occupying less computing resources, and the algorithm has the ability to support hundreds of Gbps randomness extraction. By assuming that the eavesdropper with complete knowledge of the classical noise, our generator has a randomness generation speed of 6.83 Gbps and this supports the generation of 6 Gbps information-theoretically provable quantum random numbers, which are output in real-time through peripheral component interconnect express interface.

The generation of random numbers is crucial for practical implementations of cryptographic algorithms. In this sense, hardware security modules (HSMs) include true random number generators (TRNGs) implemented in hardware to achieve good random number generation. In the case of cryptographic algorithms implemented on FPGAs, the hardware implementation of RNGs is limited to the programmable cells in the device. Among the different proposals to obtain sources of entropy and process them to implement TRNGs, those based in ring oscillators (ROs), operating in parallel and combined with XOR gates, present good statistical properties at the cost of high area requirements. In this paper, these TRNGs are revisited, showing a method for area optimization independently of the FPGA technology used. Experimental results show that three ring oscillators requiring only three LUTs are enough to build a TRNG on Artix 7 devices from Xilinx with a throughput of 33.3 Kbps, which passes NIST tests. A throughput of 50 Kbps can be achieved with four ring oscillators, also requiring three LUTs in Artix 7 devices, while 100 Kbps can be achieved using an structure with four ring oscillators requiring seven LUTs.

Random numbers are widely used in the cryptography and security systems. However, most of the true random number generators (TRNG) which use physical randomness are with high complexity and high power consumption. This paper proposes a new TRNG circuit using magnetic tunnel junction (MTJ). As one of the reliability issues in MTJ based circuit, the stochastic switching behavior provides a perfect physical source of randomness. The functionality of proposed design is validated by transient simulations with 28nm fully depleted silicon-on-insulator (FDSOI) technology and an accurate MTJ compact model. Simulation results show that our design can generate accurate random bitstream stably. The reliability analysis concerning process variation of MTJs and transistors proves the good variability tolerance of our TRNG design. Furthermore, our design can output stable random bitstream around 30 tuning steps.

We re-use a polarization-multiplexed I/Q modulator to acquire the quantum randomness of its seed laser light for the purpose of quantum random number generation. We obtain $9\times 10^{4}$ 256-bit AES keys/second after randomness extraction. Time-interleaved random number generation is demonstrated for PM-QPSK transmission.

Currently, True Random Number Generation (TRNG) is relatively slow, utilizing natural, physical processes as its entropy source. Other types of random numbers, such as Pseudo-Random Numbers, lack true randomness as eventually they repeat, but can be generated with great speed. The main idea of the work presented in this paper is to introduce parallel random number generation as a scalable means of increasing the rate of true random number generation in hardware to match and surpass that of Pseudo-Random Number Generators (PRNGs). Using a Raspberry Pi platform, this work will combine two (2) standard TRNGs to form one (1) unified, Parallel - True Random Number Generator (P-TRNG), with more than twice the output performance rate of its component TRNGs, and with demonstrated scalability.

Random number generation is a fundamental aspect of computer science, cryptography, simulations, and statistical sampling. This paper explores the definitions, classifications, and implementations of random and pseudo-random number generators (RNGs and PRNGs). We examine true random number generators (TRNGs), which derive randomness from physical phenomena, and pseudo-random number generators (PRNGs), which use deterministic algorithms to produce sequences that mimic randomness. Case studies, including Random.org, HotBits, laser-based RNGs, and the Linux random number generator, illustrate practical implementations. We also discuss vulnerabilities, security considerations, and the importance of entropy in generating unpredictable sequences.

In this paper, we propose a Ferroelectric Tunnel Junction (FTJ)-based true random number generator (TRNG) that utilizes the stochastic domain switching phenomenon in ferroelectric materials. Ferroelectrics are promising for extracting randomness owing to their innate switching entropy in the multi-domain state. The random numbers generated by the proposed TRNG are shown to pass all the NIST SP 800-22 tests. The robustness of the proposed TRNG is also validated at various temperature and process corners. Important metrics such as power, bit rate, and energy/bit are calculated. This is the first comprehensive work demonstrating a ferroelectric-based TRNG with all these metrics. Compared to state-of-the-art TRNGs using other emerging technologies, we can achieve a higher bit rate with lower power consumption. We also perform material-level optimization with different ferroelectric materials, and showcase the trade-off between the bit rate and the power consumption. The proposed TRNG shows high robustness and reliability, and thus has the potential for implementing a low power on-chip solution.

Random number generators (RNG) are essential elements in many cryptographic systems. True random number generators (TRNG) rely upon sources of randomness from natural processes such as those arising from quantum mechanics phenomena. We demonstrate that a quantum computer can serve as a high-quality, weakly random source for a generalized user-defined probability mass function (PMF). Specifically, QC measurement implements the process of variate sampling according to a user-specified PMF resulting in a word comprised of electronic bits that can then be processed by an extractor function to address inaccuracies due to non-ideal quantum gate operations and other system biases. We introduce an automated and flexible method for implementing a TRNG as a programmed quantum circuit that executes on commercially-available, gate-model quantum computers. The user specifies the desired word size as the number of qubits and a definition of the desired PMF. Based upon the user specification of the PMF, our compilation tool automatically synthesizes the desired TRNG as a structural OpenQASM file containing native gate operations that are optimized to reduce the circuit's quantum depth. The resulting TRNG provides multiple bits of randomness for each execution/measurement cycle; thus, the number of random bits produced in each execution is limited only by the size of the QC. We provide experimental results to illustrate the viability of this approach.