True Random Number Generator Based on Fibonacci-Galois Ring Oscillators for FPGA

Abstract

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 Review on Applications of Chaotic Maps in Pseudo-Random Number Generators and Encryption

“…Recently, Nannipieri et al [ 43 ] developed a true random number generator based on Fibonacci-Galois Ring Oscillators. They implemented the proposed methodology on FPGA.…”

Design and Test of an Integrated Random Number Generator with All-Digital Entropy Source

“…The internal architecture of the RNG engine is illustrated in Figure 1 , and it mainly consists of the integration of an entropy source module and a hash-based DRBG module, which are respectively described in [ 6 , 7 , 8 ]. The former is responsible for the generation of (internal) seeds that are used to initialize the internal state of the DRBG and that are built byte by byte, exploiting the Buffer unit to collect them, while the latter produces sequences of random words that constitute the output data of the whole RNG engine.…”

Designing a Novel Efficient Substitution-Box by Using a Flower Pollination Algorithm and Chaos System

“…To crack a key using a brute force attack, the attacker needs 2 k−1 (k=key length in bits). If the potential keys are not chosen randomly, entropy fails to capture the required number of guesses [46]. The entropy values are situated at an optimum interval, as shown in Table 8.…”