Modern random number generator design – Case study on a secured PLL-based TRNG

2019 ◽  
Vol 61 (1) ◽  
pp. 3-13
Author(s):  
Viktor Fischer ◽  
Florent Bernard ◽  
Nathalie Bochard
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Security Requirements ◽  
Random Numbers ◽  
Cryptographic Primitives ◽  
Random Number Generators ◽  
Cryptographic Keys ◽  
Design Case Study ◽  
Security Standards ◽  
Generator Design

Abstract Random number generators (RNGs) are basic cryptographic primitives. They are used to generate cryptographic keys, initialization vectors, challenges and nonces in cryptographic protocols, and random masks in countermeasures against side channel attacks. RNGs designed for cryptography must generate unpredictable random numbers. According to recent security standards, the unpredictability of generated random numbers must be thoroughly evaluated. In this paper, we provide a concrete example – a phase-locked loop based RNG protected by novel dedicated embedded tests, on which we show how stringent security requirements including unpredictability of generated numbers can be met, while respecting the standards.

scholarly journals TRNGs from Pre-Formed ReRAM Arrays

Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 8
Author(s):  
Bertrand Cambou ◽  
Donald Telesca ◽  
Sareh Assiri ◽  
Michael Garrett ◽  
Saloni Jain ◽  
...  
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Random Access ◽  
Random Number Generators ◽  
Cryptographic Algorithms ◽  
Cryptographic Keys ◽  
Low Levels ◽  
Stochastic Properties ◽  
Pseudo Random Number Generator ◽  
Number Of Cells

Schemes generating cryptographic keys from arrays of pre-formed Resistive Random Access (ReRAM) cells, called memristors, can also be used for the design of fast true random number generators (TRNG’s) of exceptional quality, while consuming low levels of electric power. Natural randomness is formed in the large stochastic cell-to-cell variations in resistance values at low injected currents in the pre-formed range. The proposed TRNG scheme can be designed with three interconnected blocks: (i) a pseudo-random number generator that acts as an extended output function to generate a stream of addresses pointing randomly at the array of ReRAM cells; (ii) a method to read the resistance values of these cells with a low injected current, and to convert the values into a stream of random bits; and, if needed, (iii) a method to further enhance the randomness of this stream such as mathematical, Boolean, and cryptographic algorithms. The natural stochastic properties of the ReRAM cells in the pre-forming range, at low currents, have been analyzed and demonstrated by measuring a statistically significant number of cells. Various implementations of the TRNGs with ReRAM arrays are presented in this paper.

scholarly journals Quantum Random Numbers Generated by a Cloud Superconducting Quantum Computer

2020 ◽  
pp. 17-37
Author(s):  
Kentaro Tamura ◽  
Yutaka Shikano
Keyword(s):  
Random Number ◽  
Quantum Computer ◽  
Statistical Tests ◽  
Random Number Generator ◽  
Random Number Generation ◽  
Black Box ◽  
Random Numbers ◽  
Number Generator ◽  
Random Number Generators ◽  
Simple Indicator

Abstract A cloud quantum computer is similar to a random number generator in that its physical mechanism is inaccessible to its users. In this respect, a cloud quantum computer is a black box. In both devices, its users decide the device condition from the output. A framework to achieve this exists in the field of random number generation in the form of statistical tests for random number generators. In the present study, we generated random numbers on a 20-qubit cloud quantum computer and evaluated the condition and stability of its qubits using statistical tests for random number generators. As a result, we observed that some qubits were more biased than others. Statistical tests for random number generators may provide a simple indicator of qubit condition and stability, enabling users to decide for themselves which qubits inside a cloud quantum computer to use.

scholarly journals A New Statistical Test for PRNG Based on the Attendance’s Law

2021 ◽  
pp. 37-46
Author(s):  
Babacar Alasane Ndaw ◽  
Ousmane Ndiaye ◽  
Mamadou Sanghar´e ◽  
Cheikh Thi´ecoumba Gueye
Keyword(s):  
Random Number ◽  
Statistical Tests ◽  
Random Number Generator ◽  
Deterministic Algorithm ◽  
Statistical Test ◽  
The Other ◽  
Cryptographic Primitives ◽  
Random Number Generators ◽  
Other Hand ◽  
The One

One family of the cryptographic primitives is random Number Generators (RNG) which have several applications in cryptography such that password generation, nonce generation, Initialisation vector for Stream Cipher, keystream. Recently they are also used to randomise encryption and signature schemes. A pseudo-random number generator (PRNG) or a pseudo-random bit generator (PRBG) is a deterministic algorithm that produces numbers whose distribution is on the one hand indistinguishable from uniform ie. that the probabilities of appearance of the different symbols are equal and that these appearances are all independent. On the other hand, the next output of a PRNG must be unpredictable from all its previous outputs. Indeed, A set of statistical tests for randomness has been proposed in the literature and by NIST to evaluate the security of random(pseudo) bit or block. Unfortunately there are non-random binary streams that pass these standardized tests. In this pap er, as outcome, we intro duce on the one hand a new statistical test in a static contextcalled attendance’s law and on the other hand a distinguisher based on this new attendance’s law.    

scholarly journals Novel Memristor Based True Random Number Generator

2020 ◽  
Author(s):  
Scott Stoller
Keyword(s):  
Random Number ◽  
Statistical Tests ◽  
Random Number Generator ◽  
Circuit Board ◽  
Random Numbers ◽  
Number Generator ◽  
Random Number Generators ◽  
Coin Toss ◽  
True Random Number Generator ◽  
Digital World

Random numbers are an important, but often overlooked part of the modern computing environment. They are used everywhere around us for a variety of purposes, from simple decision making in video games such as a coin toss, to securing financial transactions and encrypting confidential communications. They are even useful for gambling and the lottery. Random numbers are generated in many ways. Pseudo random number generators (PRNGs) generate numbers based on a formula. True random number generators (TRNGs) capture entropy from the environment to generate randomness. As our society and our devices become more connected in the digital world, it is important to develop new ways to generate truly random numbers in order to secure communications and connected devices. In this work a novel memristor-based True Random Number Generator is designed and a physical implementation is fabricated and tested using a W-based self-directed channel (SDC) memristor. The circuit was initially designed and prototyped on a breadboard. A custom Printed Circuit Board (PCB) was fabricated for the final circuit design and testing of the novel memristor-based TRNG. The National Institute of Standards and Technology (NIST) Statistical Test Suite (STS) was used to check the output of the TRNG for randomness. The TRNG was demonstrated to pass 13 statistical tests out of the 15 in the STS.

scholarly journals Mathematical model of physical RNGs based on coherent sampling

2010 ◽  
Vol 45 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Florent Bernard ◽  
Viktor Fischer ◽  
Boyan Valtchanov
Keyword(s):  
Mathematical Model ◽  
Random Number ◽  
Noise Source ◽  
Statistical Properties ◽  
Security Requirements ◽  
Phase Locked Loops ◽  
Security Evaluation ◽  
Cryptographic Primitives ◽  
Random Number Generators ◽  
Delay Locked Loops

ABSTRACT Random number generators represent one of basic cryptographic primitives used in creating cryptographic protocols. Their security evaluation represents very important part in the design, implementation and employment phase of the generator. One of important security requirements is the existence of a mathematical model describing the physical noise source and the statistical properties of the digitized noise derived from it. The aim of this paper is to propose the model of a class of generators using two jittery clocks with rationally related frequencies. The clock signals with related frequencies can be obtained using phase-locked loops, delay-locked loops or ring oscillators with adjusted oscillation periods. The proposed mathematical model is used to provide entropy per bit estimators and expected bias on the generated sequence. The model is validated by hardware experiments.

scholarly journals Novel Certification Method for Quantum Random Number Generators

2021 ◽  
Vol 13 (3) ◽  
pp. 28-38
Author(s):  
Maksim Iavich ◽  
◽  
Tamari Kuchukhidze ◽  
Sergiy Gnatyuk ◽  
Andriy Fesenko
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Random Number Generation ◽  
Random Numbers ◽  
Random Number Generators ◽  
Advantages And Disadvantages ◽  
Simulation Techniques ◽  
Self Testing ◽  
Certification Method

Random numbers have many uses, but finding true randomness is incredibly difficult. Therefore, quantum mechanics is used, using the essentially unpredictable behavior of a photon, to generate truly random numbers that form the basis of many modern cryptographic protocols. It is essential to trust cryptographic random number generators to generate only true random numbers. This is why certification methods are needed which will check both the performance of our device and the quality of the random bits generated. Self-testing as well as device independent quantum random number generation methods are analyzed in the paper. The advantages and disadvantages of both methods are identified. The model of a novel semi self-testing certification method for quantum random number generators is offered in the paper. This method combines different types of certification approaches and is rather secure and efficient. The method is very important for computer science, because it combines the best features from selftesting and device independent methods. It can be used, when the random numbers’ entropy depends on the device and when it does not. In the related researches, these approaches are offered to be used separately, depending on the random number generator. The offered novel certification technology can be properly used, when the device is compromised or spoiled. The technology can successfully detect unintended irregularities, operational problems, abnormalities and problems in the randomization process. The offered mythology assists to eliminate problems related to physical devices. The offered system has the higher certification randomness security and is faster than self-testing approaches. The method is rather efficient because it implements the different certification approaches in the parallel threads. The offered techniques make the offered research must more efficient than the other existing approaches. The corresponding programming simulation is implemented by means of the simulation techniques.

scholarly journals Quantum generators of random numbers

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Marcin M. Jacak ◽  
Piotr Jóźwiak ◽  
Jakub Niemczuk ◽  
Janusz E. Jacak
Keyword(s):  
Information Processing ◽  
Random Number ◽  
Random Number Generator ◽  
Random Numbers ◽  
Generation Process ◽  
Pseudorandom Generator ◽  
Random Number Generators ◽  
Random Generator ◽  
Number Sequences

AbstractGeneration of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.

A New Secure and Efficient Approach for TRNG and Its Post-Processing Algorithms

2020 ◽  
Vol 29 (15) ◽  
pp. 2050244
Author(s):  
Selman Yakut ◽  
Taner Tuncer ◽  
Ahmet Bedri Özer
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Security Requirements ◽  
Processing Algorithm ◽  
Random Numbers ◽  
Test Results ◽  
Data Loss ◽  
Post Processing ◽  
Hash Algorithm ◽  
Processing Algorithms

Random numbers are important parameters for the security of cryptographic applications. In this study, a secure and efficient generator is proposed to generate random numbers. The first part of the generator is a true random number generator that consists of chaotic systems implemented on FPGA. The second part of the generator is a post-processing algorithm used to overcome the problems that emerge from the generator or environmental factors. As the post-processing algorithm, Keccak, the latest standard of hash algorithm, was rearranged and used. Random numbers with the proposed approach meet the security requirements for cryptographic applications. Furthermore, the NIST 800-22 test suite and autocorrelation test are used to ensure the generated numbers have no statistical weakness. The successful test results demonstrate the security of the generated numbers. An important advantage of the proposed generator does not cause any data loss and perform 100% efficiency although data loss can be up to 70% in some post-processing algorithms.

scholarly journals Secure and Efficient Hybrid Random Number Generator Based on Sponge Constructions for Cryptographic Applications

2019 ◽  
Vol 25 (4) ◽  
pp. 40-46 ◽  
Author(s):  
Selman Yakut ◽  
Taner Tuncer ◽  
Ahmet Bedri Ozer
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Hash Functions ◽  
Security Requirements ◽  
Test Suite ◽  
Random Numbers ◽  
Number Generator ◽  
Vital Importance ◽  
Additional Input ◽  
Algorithmic Structure

Random numbers constitute the most important part of many applications and have a vital importance in the security of these applications, especially in cryptography. Therefore, there is a need for secure random numbers to provide their security. This study is concerned with the development of a secure and efficient random number generator that is primarily intended for cryptographic applications. The generator consists of two subsystems. The first is algorithmic structure, Keccak, which is the latest standard for hash functions. The structure provides to generate secure random numbers. The second is additional input that generates with ring oscillators that are implemented on the FPGA. The additional inputs prevent reproduction and prediction of the subsequent random numbers. It is shown that the proposed generator is satisfies security requirements for cryptographic applications. In addition, NIST 800-22 test suite and autocorrelation test are used to demonstrate that generated random numbers have no statistical weaknesses and relationship among itself, respectively. Successful results from these tests show that generated numbers have no statistical weaknesses. Moreover, important advantage of the proposed generator is that it is more efficient than existing RNGs in the literature.

scholarly journals Random Numbers Generated from Audio and Video Sources

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
I-Te Chen
Keyword(s):  
Chaos Theory ◽  
Random Number ◽  
Statistical Tests ◽  
Random Number Generator ◽  
Random Numbers ◽  
Pseudorandom Number Generator ◽  
Number Generator ◽  
Random Number Generators ◽  
Video File ◽  
Recognition Probability

Random numbers are very useful in simulation, chaos theory, game theory, information theory, pattern recognition, probability theory, quantum mechanics, statistics, and statistical mechanics. The random numbers are especially helpful in cryptography. In this work, the proposed random number generators come from white noise of audio and video (A/V) sources which are extracted from high-resolution IPCAM, WEBCAM, and MPEG-1 video files. The proposed generator applied on video sources from IPCAM and WEBCAM with microphone would be the true random number generator and the pseudorandom number generator when applied on video sources from MPEG-1 video file. In addition, when applying NIST SP 800-22 Rev.1a 15 statistics tests on the random numbers generated from the proposed generator, around 98% random numbers can pass 15 statistical tests. Furthermore, the audio and video sources can be found easily; hence, the proposed generator is a qualified, convenient, and efficient random number generator.

Sign in / Sign up

Export Citation Format

Share Document