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

Optical Quantum Random Number Generator

André Stefanov, Nicolas Gisin, Olivier Guinnard, Laurent Guinnard, Hugo Zbinden

Published Jan 1, 1999• 224 citations
OpenAlex

Abstract

A physical random number generator based on the intrinsic randomness of quantum mechanics is described. The random events are realized by the choice of single photons between the two outputs of a beamsplitter. We present a simple device, which minimizes the impact of the photon counters ’ noise, dead-time and after pulses. Random numbers are employed today as well for numerical simulations as for cryptography. Unfortunately computers are not able to generate true random numbers, as they are deterministic systems. Numerical pseudo-random generators rely on complexity [1]. Although such pseudo-random numbers can generally be employed for numerical computation, such as Monte-Carlo simulations, their use in cryptography, for example to generate keys, is more critical. The only way to get true random numbers, hence true security for crypto-systems, is to build a generator based on a random physical phenomenon [2,3,4]. As quantum theory is intrinsically random, a quantum process is an ideal base for a physical random number generator. The randomness of a sequence of numbers can be extensively tested, though not proven. It is thus of interest to thoroughly understand the behavior of the random process, so as to gain

Related papers

Optical quantum random number generator

André Stefanov, Nicolas Gisin, Olivier Guinnard +2 more

A physical random number generator based on the intrinsic randomness of quantum mechanics is described. The random events are realized by the choice of single photons between the two outputs of a beam splitter. We present a simple device, which minimizes the impact of the photon counters' noise, dead-time and after pulses.

arXiv:quant-ph/9907006•Journal of Modern Optics•Mar 1, 2000•124 citations

A Fast and Compact Quantum Random Number Generator

Thomas Jennewein, Ulrich Achleitner, Gregor Weihs +2 more

We present the realization of a physical quantum random number generator based on the process of splitting a beam of photons on a beam splitter, a quantum mechanical source of true randomness. By utilizing either a beam splitter or a polarizing beam splitter, single photon detectors and high speed electronics the presented devices are capable of generating a binary random signal with an autocorrelation time of 11.8 ns and a continuous stream of random numbers at a rate of 1 Mbit/s. The randomness of the generated signals and numbers is shown by running a series of tests upon data samples. The devices described in this paper are built into compact housings and are Random numbers are a vital ingredient in many applications ranging, to name some examples, from computational methods such as Monte Carlo simulations and programming1, over to the large field of cryptography for generating of crypto code or masking messages, as far as to commercial applications like lottery games and slot machines2–5. Recently

•Dec 29, 1999•291 citations

An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response

Mario Stipčević, Rupert Ursin

Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physical process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, which can be described by a probabilistic theory only, even in principle. Here we present a conceptually simple implementation, which offers a 100% efficiency of producing a random bit upon a request and simultaneously exhibits an ultra low latency. A careful technical and statistical analysis demonstrates its robustness against imperfections of the actual implemented technology and enables to quickly estimate randomness of very long sequences. Generated random numbers pass standard statistical tests without any post-processing. The setup described, as well as the theory presented here, demonstrate the maturity and overall understanding of the technology.

arXiv:1407.4602•Scientific Reports•Jun 9, 2015•34 citations

Quantum random number generators and their applications 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 physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 1, 2012•40 citations

Novel Quantum Random Number Generator for Cryptographical Applications

Maksim Iavich, Tamari Kuchukhidze, Tetyana Okhrimenko +1 more

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.

International Scientific-Practical Conference Problems of Infocommunications Science and Technology•Oct 6, 2020•4 citations

Quantum random number generator

Jan Soubusta, Ondřej Haderka, Martin Hendrych

Since reflection or transmission of a quantum particle on a beamsplitter is inherently random quantum process, a device built on this principle does not suffer from drawbacks of neither pseudo-random computer generators or classical noise sources. Nevertheless, a number of physical conditions necessary for high quality random numbers generation must be satisfied. Luckily, in quantum optics realization they can be well controlled. We present an easy random number generator based on the division of weak light pulses on a beamsplitter. The randomness of the generated bit stream is supported by passing the data through series of 15 statistical test. The device generates at a rate of 109.7 kbit/s.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 7, 2001•0 citations
A physical random number generator based on the intrinsic randomness of quantum mechanics is described. The random events are realized by the choice of single photons between the two outputs of a beamsplitter. We present a simple device, which minimizes the impact of the photon counters ’ noise, dead-time and after pulses. Random numbers are employed today as well for numerical simulations as for cryptography. Unfortunately computers are not able to generate true random numbers, as they are deterministic systems. Numerical pseudo-random generators rely on complexity [1]. Although such pseudo-random numbers can generally be employed for numerical computation, such as Monte-Carlo simulations, their use in cryptography, for example to generate keys, is more critical. The only way to get true random numbers, hence true security for crypto-systems, is to build a generator based on a random physical phenomenon [2,3,4]. As quantum theory is intrinsically random, a quantum process is an ideal base for a physical random number generator. The randomness of a sequence of numbers can be extensively tested, though not proven. It is thus of interest to thoroughly understand the behavior of the random process, so as to gain
We present the realization of a physical quantum random number generator based on the process of splitting a beam of photons on a beam splitter, a quantum mechanical source of true randomness. By utilizing either a beam splitter or a polarizing beam splitter, single photon detectors and high speed electronics the presented devices are capable of generating a binary random signal with an autocorrelation time of 11.8 ns and a continuous stream of random numbers at a rate of 1 Mbit/s. The randomness of the generated signals and numbers is shown by running a series of tests upon data samples. The devices described in this paper are built into compact housings and are Random numbers are a vital ingredient in many applications ranging, to name some examples, from computational methods such as Monte Carlo simulations and programming1, over to the large field of cryptography for generating of crypto code or masking messages, as far as to commercial applications like lottery games and slot machines2–5. Recently
Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physical process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, which can be described by a probabilistic theory only, even in principle. Here we present a conceptually simple implementation, which offers a 100% efficiency of producing a random bit upon a request and simultaneously exhibits an ultra low latency. A careful technical and statistical analysis demonstrates its robustness against imperfections of the actual implemented technology and enables to quickly estimate randomness of very long sequences. Generated random numbers pass standard statistical tests without any post-processing. The setup described, as well as the theory presented here, demonstrate the maturity and overall understanding of the technology.
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 physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
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.
Since reflection or transmission of a quantum particle on a beamsplitter is inherently random quantum process, a device built on this principle does not suffer from drawbacks of neither pseudo-random computer generators or classical noise sources. Nevertheless, a number of physical conditions necessary for high quality random numbers generation must be satisfied. Luckily, in quantum optics realization they can be well controlled. We present an easy random number generator based on the division of weak light pulses on a beamsplitter. The randomness of the generated bit stream is supported by passing the data through series of 15 statistical test. The device generates at a rate of 109.7 kbit/s.