Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Noise and Fluctuations

True Random Numbers Generation from stationary Stochastic Processes

Giuseppe Martini, Francesco G. Bruno

Published Jun 1, 2017• 6 citations
Publisher

Abstract

Efficient and reliable Random Number Generator (RNG) are increasingly demanded in cryptographic applications, such as on-the-fly data encription/decription and as a general tool for data protection. Main requirement of RNG is a true randomness, which is achievable by means of physical randomness sources only. A True-RNG based on two independent Stochastic Processes (SP) is presented and discussed. As primary randomness sources, two radioactive decay processes are used. A radioactive source has many advantages over others noise sources, since the decay rate of any nuclide does not depend on temperature, chemical composition, physical state, environmental conditions, and aging. In addition, in U ore for example, the various nuclides are, at very good approximation, at equilibrium in the decay chain, so that many stationary independent SP's with the same statistics can be simply obtained by detecting and selectively routing, e.g. by pulse amplitude sorting, gamma rays of different energy emitted by different nuclides in the decay chain. Simulation is performed by a numerical code. The random bit stream obtained is tested for randomness by the NIST test suite, and results are shown. A hardware implementation of the system is also presented.

DOI
10.1109/icnf.2017.7985997

Related papers

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.4381•International Convention on Information and Communication Technology, Electronics and Microelectronics•Mar 22, 2011•22 citations

Random number generator for cryptography

Ram Soorat, K. Madhuri, Ashok Vudayagiri

One key requirement for many cryptograhic schemes is the generation of random numbers.Sequences of random numbers are used at several stages of a standard cryptographic protocol.One simple example is a Vernam cipher, where a string of random numbers is added to message string to generate encrypted code.C = M ⊕ K.It has been mathematically shown that this simple scheme is unbreakable if key K is as long as M and is used only once.The security of a cryptosystem shall not be based on keeping the algorithm secret but solely on keeping the key secret.The security of a random number generator (RNG) is related to the difficulty of predicting its future sequence values from past values.The quality and unpredictability of secret data is critical to securing communication by modern cryptographic techniques.The generation of such data for cryptographic purposes typically requires an unpredictable physical source of random data.We studied a chaotic circuit which consisted of an inductor, capacitance, diode and thus used for the BB84 protocol.We have studied both pseudo random and true random number generators and evaluated them through various tests like frequency, correlation, NIST etc.

Nanosystems Physics Chemistry Mathematics•Oct 27, 2017•7 citations

Celestial sources for random number generation

Erin Chapman, Jerina Grewar, Tim J. Natusch

In this paper, we present an alternative method of gathering seed data for random number generation (RNG) in cryptographic applications. Our proposed method utilises the inherent randomness of signal data from celestial sources in radio astronomy to provide seeds for RNG. The data sets were collected from two separate celestial sources, and run through the SHA-256 algorithm to deskew the data and produce random numbers with a uniform distribution. The resulting data sets pass all tests in the NIST Statistical Test Suite for random data, with a mean of 98.9% of the 512 total bitstreams from the two sources passing all tests in the NIST suite, as well as further testing in R. These results are on par with the control set generated using Java’s SecureRandom function. An explanation of the sources, the data processing and detailed results of each of the tests are presented.

Australasian Journal of Paramedicine•Jan 1, 2016•2 citations

True randomness from realistic quantum devices

Daniela Frauchiger, Renato Renner, Matthias Troyer

Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be proved based on physical principles. Practical implementations of Quantum RNGs (QRNGs) are however always subject to noise, i.e., influences which are not fully controlled. This reduces the quality of the raw randomness generated by the device, making it necessary to post-process it. Here we provide a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.

arXiv:1311.4547•Nov 18, 2013•102 citations

A Photonic-based Random Number Generator for Cryptographic Application

Norashikin Mohd Thamrin, Gunawan Witjaksono, A. Nuruddin +1 more

In this paper, we design a photonic-based true random number generator (True RNG) which is targeted for cryptographic application .Since all security protocols rely on unpredictability, RNGs for crypto applications must meet stringent requirements. The design employs a single-photon detection to generate a random signal which is useful in producing random output. In contrast with traditionally used of frequency sampler circuitry during bit extraction method, it uses a novel method of randomness extraction based on time interval between two successive random signals. The design comprises an optical setup and extremely compact and digitally random bit extraction circuitry which can be implemented on any advance crypto hardware devices. A NIST statistical test is used to test the randomness of the RNG output and has produced a good result. With the help of this True RNG, the cryptographic implementations can be secure enough from being abused of malicious act.

ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)•Jan 1, 2008•10 citations

Demonstration of 30 Gbit/s Generation of Superconductive True Random Number Generator

Tatsuro Sugiura, Yuki Yamanashi, Nobuyuki Yoshikawa

True random number generators, which output truly random numbers by extracting entropy from physical phenomena such as thermal and electronic noises, are widely used in the field of the cryptographic communication systems. We have been developing a superconductive true random number generator that can generate truly random number sequences, impossible to be predicted, by utilizing the high-speed operation and high-sensitivity of superconductive integrated circuits. In this study, we have calculated the dependences of correlation of output random bits on the generation rate. Statistical tests have been performed on the basis of the NIST statistical test suite in order to evaluate the quality of the randomness of sequences generated by the superconductive true random number generator at high generation rate. We have generated a random number sequence consisting of 3.2 M-bit at the generation rate of 30 Gbit/s using the superconductive true random number generator, fabricated by the ISTEC-SRL 2.5 kA/cm2Nb standard process. The generated random number sequences passed 13 kinds of the statistical tests in the NIST statistical test suit, although the 3 tests were not performed because of the shortage of the generated random numbers. The result sufficiently proves that a superconductive true random number generator can generate a high quality of random numbers that can be used for practical cryptographic applications, at a generation rate of up to 30 Gbit/s.

IEEE Transactions on Applied Superconductivity•Dec 23, 2010•44 citations
Efficient and reliable Random Number Generator (RNG) are increasingly demanded in cryptographic applications, such as on-the-fly data encription/decription and as a general tool for data protection. Main requirement of RNG is a true randomness, which is achievable by means of physical randomness sources only. A True-RNG based on two independent Stochastic Processes (SP) is presented and discussed. As primary randomness sources, two radioactive decay processes are used. A radioactive source has many advantages over others noise sources, since the decay rate of any nuclide does not depend on temperature, chemical composition, physical state, environmental conditions, and aging. In addition, in U ore for example, the various nuclides are, at very good approximation, at equilibrium in the decay chain, so that many stationary independent SP's with the same statistics can be simply obtained by detecting and selectively routing, e.g. by pulse amplitude sorting, gamma rays of different energy emitted by different nuclides in the decay chain. Simulation is performed by a numerical code. The random bit stream obtained is tested for randomness by the NIST test suite, and results are shown. A hardware implementation of the system is also presented.
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.
One key requirement for many cryptograhic schemes is the generation of random numbers.Sequences of random numbers are used at several stages of a standard cryptographic protocol.One simple example is a Vernam cipher, where a string of random numbers is added to message string to generate encrypted code.C = M ⊕ K.It has been mathematically shown that this simple scheme is unbreakable if key K is as long as M and is used only once.The security of a cryptosystem shall not be based on keeping the algorithm secret but solely on keeping the key secret.The security of a random number generator (RNG) is related to the difficulty of predicting its future sequence values from past values.The quality and unpredictability of secret data is critical to securing communication by modern cryptographic techniques.The generation of such data for cryptographic purposes typically requires an unpredictable physical source of random data.We studied a chaotic circuit which consisted of an inductor, capacitance, diode and thus used for the BB84 protocol.We have studied both pseudo random and true random number generators and evaluated them through various tests like frequency, correlation, NIST etc.
In this paper, we present an alternative method of gathering seed data for random number generation (RNG) in cryptographic applications. Our proposed method utilises the inherent randomness of signal data from celestial sources in radio astronomy to provide seeds for RNG. The data sets were collected from two separate celestial sources, and run through the SHA-256 algorithm to deskew the data and produce random numbers with a uniform distribution. The resulting data sets pass all tests in the NIST Statistical Test Suite for random data, with a mean of 98.9% of the 512 total bitstreams from the two sources passing all tests in the NIST suite, as well as further testing in R. These results are on par with the control set generated using Java’s SecureRandom function. An explanation of the sources, the data processing and detailed results of each of the tests are presented.
Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be proved based on physical principles. Practical implementations of Quantum RNGs (QRNGs) are however always subject to noise, i.e., influences which are not fully controlled. This reduces the quality of the raw randomness generated by the device, making it necessary to post-process it. Here we provide a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.
In this paper, we design a photonic-based true random number generator (True RNG) which is targeted for cryptographic application .Since all security protocols rely on unpredictability, RNGs for crypto applications must meet stringent requirements. The design employs a single-photon detection to generate a random signal which is useful in producing random output. In contrast with traditionally used of frequency sampler circuitry during bit extraction method, it uses a novel method of randomness extraction based on time interval between two successive random signals. The design comprises an optical setup and extremely compact and digitally random bit extraction circuitry which can be implemented on any advance crypto hardware devices. A NIST statistical test is used to test the randomness of the RNG output and has produced a good result. With the help of this True RNG, the cryptographic implementations can be secure enough from being abused of malicious act.
True random number generators, which output truly random numbers by extracting entropy from physical phenomena such as thermal and electronic noises, are widely used in the field of the cryptographic communication systems. We have been developing a superconductive true random number generator that can generate truly random number sequences, impossible to be predicted, by utilizing the high-speed operation and high-sensitivity of superconductive integrated circuits. In this study, we have calculated the dependences of correlation of output random bits on the generation rate. Statistical tests have been performed on the basis of the NIST statistical test suite in order to evaluate the quality of the randomness of sequences generated by the superconductive true random number generator at high generation rate. We have generated a random number sequence consisting of 3.2 M-bit at the generation rate of 30 Gbit/s using the superconductive true random number generator, fabricated by the ISTEC-SRL 2.5 kA/cm2Nb standard process. The generated random number sequences passed 13 kinds of the statistical tests in the NIST statistical test suit, although the 3 tests were not performed because of the shortage of the generated random numbers. The result sufficiently proves that a superconductive true random number generator can generate a high quality of random numbers that can be used for practical cryptographic applications, at a generation rate of up to 30 Gbit/s.