Fast True Random Generator in FPGAs

Jean‐Luc Danger, Sylvain Guilley, Philippe Hoogvorst

Published Aug 1, 2007• 32 citations

Abstract

Most hardware "true" random number generators (TRNGs) take advantage of the thermal agitation around a flip-flop metastable state. In field programmable gate arrays (FPGAs), the classical TRNG structure uses two clocks, either from a PLL or from ring oscillators, in order to sample one by the other. This creates good TRNGs albeit limited in frequency by the interference rate which cannot exceed a few Mbit/s. This article presents an architecture allowing higher bit rates while maintaining provable unconditional security. This requirement becomes stringent for secure communication applications such as the cryptographic quantum key distribution (QKD) protocols. The proposed architecture is very simple as it is based on an open loop structure without any specific component such as PLLs.

DOI: 10.1109/newcas.2007.4487970

Related papers

TRNG integration in FPGA-based QKD Control Electronics

Mohd Razin Ashfaque, Vaibhav Pratap Singh, Mahesh Kondeti +4 more

Our work aims to introduce an FPGA-based electronics architecture designed to enhance the security of quantum key distribution (QKD) networks. The core focus is on integrating a true random number generator (TRNG) IP in an FPGA-based QKD control electronics implemented on Xilinx’s ZYNQ UltraScale+ based FPGA boards. The work presents the challenges in integrating an existing TRNG IP with QKD FPGA design, different bit and timing requirements, the subsequent speed mismatch issues, support for multiple QKD protocols (Coherent One-Way (CoW) and Differential Phase Shift (DPS)) and user-defined QKD implementations. The integrated design also supports external QRNG/TRNG over USB/Ethernet.

IEEE Space, Aerospace and Defence Conference (SPACE)Jul 22, 20241 citation

Efficient FPGA implementation of high-speed true random number generator

Zhenguo Lu, Shenshen Yang, Jianqiang Liu +2 more

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.

Review of Scientific InstrumentsFeb 1, 20214 citations

Theory and implementation of a very high throughput true random number generator in field programmable gate array

Yonggang Wang, Cong Hui, Chong Liu +1 more

The contribution of this paper is proposing a new entropy extraction mechanism based on sampling phase jitter in ring oscillators to make a high throughput true random number generator in a field programmable gate array (FPGA) practical. Starting from experimental observation and analysis of the entropy source in FPGA, a multi-phase sampling method is exploited to harvest the clock jitter with a maximum entropy and fast sampling speed. This parametrized design is implemented in a Xilinx Artix-7 FPGA, where the carry chains in the FPGA are explored to realize the precise phase shifting. The generator circuit is simple and resource-saving, so that multiple generation channels can run in parallel to scale the output throughput for specific applications. The prototype integrates 64 circuit units in the FPGA to provide a total output throughput of 7.68 Gbps, which meets the requirement of current high-speed quantum key distribution systems. The randomness evaluation, as well as its robustness to ambient temperature, confirms that the new method in a purely digital fashion can provide high-speed high-quality random bit sequences for a variety of embedded applications.

Review of Scientific InstrumentsApr 1, 201621 citations

Quantum random number generators and their use in cryptography

Mario Stipčević

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.

arXiv:1103.4381International Convention on Information and Communication Technology, Electronics and MicroelectronicsMar 22, 201118 citations

Quantum Random Number Generation for 1.25-GHz Quantum Key Distribution Systems

Anthony Martin, Bruno Sanguinetti, Charles Ci Wen Lim +2 more

Security proofs of quantum key distribution (QKD) systems usually assume that the users have access to source of perfect randomness. State-of-the-art QKD systems run at frequencies in the gigahertz range, requiring a sustained gigahertz rate of generation and acquisition of quantum random numbers. In this paper, we demonstrate such a high-speed random number generator. The entropy source is based on an amplified spontaneous emission from an erbium-doped fibre, which is directly acquired using a standard small form-factor pluggable module. The module connects to the field programmable gate array (FPGA) of a QKD system. A real-time randomness extractor is implemented in the FPGA, and achieves a sustained rate of 1.25 Gb/s of provably random bits.

arXiv:1504.07769Journal of Lightwave TechnologyApr 7, 201548 citations

A programmable true random number generator using commercial quantum computers

Aviraj Sinha, Elena R. Henderson, Jessie M. Henderson +2 more

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.

arXiv:2304.03830Jun 13, 202310 citations