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

Vestnik of Saint Petersburg University Applied Mathematics Computer Science Control Processes

Mathematical model of random number generator based on vacuum fluctuations

Andrei Gaidash, R. Goncharov, Anton Kozubov, Pavel V. Yakovlev

Published Jan 1, 2024• 2 citations
Publisher

Abstract

A mathematical model of quantum random number generator based on vacuum fluctuations is considered. A mathematical justification for the “randomness” of the generated sequence is given under the assumption of the truth of the basic postulates of quantum theory and the validity of the Poisson probability distribution for the photon flux. The results of experiments and the obtained estimates of the minimum entropy are presented.

DOI
10.21638/spbu10.2024.202

Related papers

Quantum random number generator using vacuum fluctuations

B. E. Pervushin, M.A. Fadeev, A.V. Zinovev +4 more

Experimental implementation of a quantum random number generator based on vacuum fluctuation is presented in this paper.A Y-splitter is used in optical setup of the quantum random number generator.The generation of random numbers in real time with a speed of 300 Mb/s is demonstrated.The conditional minimum entropy is used to estimate the randomness.A cryptographic hashing function is used for post-processing.The resulting sequence has passed DieHard and NIST statistical tests successfully.

Nanosystems Physics Chemistry Mathematics•Apr 29, 2021•2 citations

Fiber quantum random number generator, based on vacuum fluctuations

A. E. Ivanova, Sergey A. Chivilikhin, George P. Miroshnichenko +1 more

Quantum random number generation allows one to obtain the absolutely random sequences by using nondeterministic physical processes.Fluctuations of the vacuum, recorded by homodyne detection, can be one of the entropy sources in those generators.In this paper, a system of quantum random numbers generation, based on vacuum fluctuations and using a fiber Y-splitter is presented.

Nanosystems Physics Chemistry Mathematics•Aug 25, 2017•2 citations

Quantum random number generator based on quantum nature of vacuum fluctuations

A. E. Ivanova, Sergey A. Chivilikhin, Artur V. Gleim

Quantum random number generator (QRNG) allows obtaining true random bit sequences. In QRNG based on quantum nature of vacuum, optical beam splitter with two inputs and two outputs is normally used. We compare mathematical descriptions of spatial beam splitter and fiber Y-splitter in the quantum model for QRNG, based on homodyne detection. These descriptions were identical, that allows to use fiber Y-splitters in practical QRNG schemes, simplifying the setup. Also we receive relations between the input radiation and the resulting differential current in homodyne detector. We experimentally demonstrate possibility of true random bits generation by using QRNG based on homodyne detection with Y-splitter.

Journal of Physics Conference Series•Nov 1, 2017•4 citations

Entropy and Randomness: From Analogic to Quantum World

Emil Simion

This work is dedicated to the construction and evaluation of random number generators used in cryptography. The critical element on which the security of information is based is the cryptographic key (usually a binary sequence). In order to be resistant to brute force attacks it is necessary that it be made up of random variables with a certain degree of randomness and independence. Formally, this comes back to generate the cryptographic key through the systems which ensures a certain minimum level of entropy. The observer has access to a sample, of a certain size, and based on it he will estimate the minimum value of the entropy, in the situations in which the variables resulting from the measurement process are independent. In the situation where these variables are not independent, complex mathematical procedures also allow estimation of the minimum entropy. This article is a review of how mathematical entropy can be estimated and evaluated, of the construction mode (from technologies based on analogue procedures: thermal noise in a transistor to modern procedures: quantum devices), as well as to evaluate the security of binary sequence generators used for generating cryptographic keys or critical security parameters related to new technologies based on quantum principles. The techniques and methods used to generate binary random values as well as the methods of statistical and informational validation (Shannon entropy) are exemplified in this paper.

IEEE Access•Jan 1, 2020•33 citations

Characterization of a Quantum Random Number Generator Based on Vacuum Fluctuations

Maurício Jonas Ferreira, Nuno A. Silva, Armando N. Pinto +1 more

Quantum random number generators (QRNGs) are currently in high demand across a large number of cryptographic applications as secure sources of true randomness. In this work, we characterize the conditions from which randomness can be extracted in a QRNG based on homodyne measurements of vacuum fluctuations by assessing the impact of experimental limitations, such as the digitizer resolution or the presence of excess local oscillator (LO) noise due to an unbalanced detection. Moreover, we propose an estimation method to quantify the excess entropy contribution introduced by an unbalanced detection and analyze the implementation of the post-processing algorithm. Finally, we submitted the generated numbers to a set of statistical tests to assess the quality of its output randomness and verified that it passes the standard libraries.

Applied Sciences•Aug 12, 2021•18 citations

Quantum random number generators, extraction of provably random bit sequences from Markov chain trajectories

Igor M. Arbekov, S. N. Molotkov

One of the main problems in the construction of quantum random number generators Ð obtainment of a provably random output sequence from physical measurements, i.e., from an initial sequence generated by a physical random number generator Ð is investigated.The conceptual feasibility and the conditions under which randomness can be `reached,' as well as the meaning of the `provable randomness' term, are discussed.We consider the methods of extracting provably random bit sequences from stationary Markov chains of finite order, i.e., under the assumption of the finite depth of the dependence of the results of physical measurements on the prehistory, which is an adequate approximation of the real situation.The extraction of the output provably random bit sequence from the initial sequence of the results of physical measurements using V F Babkin's effective arithmetic coding method is demonstrated.It is shown that random bit sequences can be provably obtained even from primary sequences of the results of physical measurements, which are dependent on (correlated to) any finite depth (prehistory).We aim to reveal the connection of various approximations employed in the development and description of methods for obtaining random bit sequences with the basic physical limitations of Nature.The mathematical proofs are detailed to the level of practical algorithms applied in real random number generators.The necessary mathematical propositions are presented at an intuitive level for physicists, do not require prior knowledge in this area, and are comprehensible to undergraduate university students.

Physics-Uspekhi•Feb 1, 2024•3 citations
A mathematical model of quantum random number generator based on vacuum fluctuations is considered. A mathematical justification for the “randomness” of the generated sequence is given under the assumption of the truth of the basic postulates of quantum theory and the validity of the Poisson probability distribution for the photon flux. The results of experiments and the obtained estimates of the minimum entropy are presented.
Quantum random number generator (QRNG) allows obtaining true random bit sequences. In QRNG based on quantum nature of vacuum, optical beam splitter with two inputs and two outputs is normally used. We compare mathematical descriptions of spatial beam splitter and fiber Y-splitter in the quantum model for QRNG, based on homodyne detection. These descriptions were identical, that allows to use fiber Y-splitters in practical QRNG schemes, simplifying the setup. Also we receive relations between the input radiation and the resulting differential current in homodyne detector. We experimentally demonstrate possibility of true random bits generation by using QRNG based on homodyne detection with Y-splitter.
This work is dedicated to the construction and evaluation of random number generators used in cryptography. The critical element on which the security of information is based is the cryptographic key (usually a binary sequence). In order to be resistant to brute force attacks it is necessary that it be made up of random variables with a certain degree of randomness and independence. Formally, this comes back to generate the cryptographic key through the systems which ensures a certain minimum level of entropy. The observer has access to a sample, of a certain size, and based on it he will estimate the minimum value of the entropy, in the situations in which the variables resulting from the measurement process are independent. In the situation where these variables are not independent, complex mathematical procedures also allow estimation of the minimum entropy. This article is a review of how mathematical entropy can be estimated and evaluated, of the construction mode (from technologies based on analogue procedures: thermal noise in a transistor to modern procedures: quantum devices), as well as to evaluate the security of binary sequence generators used for generating cryptographic keys or critical security parameters related to new technologies based on quantum principles. The techniques and methods used to generate binary random values as well as the methods of statistical and informational validation (Shannon entropy) are exemplified in this paper.
Quantum random number generators (QRNGs) are currently in high demand across a large number of cryptographic applications as secure sources of true randomness. In this work, we characterize the conditions from which randomness can be extracted in a QRNG based on homodyne measurements of vacuum fluctuations by assessing the impact of experimental limitations, such as the digitizer resolution or the presence of excess local oscillator (LO) noise due to an unbalanced detection. Moreover, we propose an estimation method to quantify the excess entropy contribution introduced by an unbalanced detection and analyze the implementation of the post-processing algorithm. Finally, we submitted the generated numbers to a set of statistical tests to assess the quality of its output randomness and verified that it passes the standard libraries.
One of the main problems in the construction of quantum random number generators Ð obtainment of a provably random output sequence from physical measurements, i.e., from an initial sequence generated by a physical random number generator Ð is investigated.The conceptual feasibility and the conditions under which randomness can be `reached,' as well as the meaning of the `provable randomness' term, are discussed.We consider the methods of extracting provably random bit sequences from stationary Markov chains of finite order, i.e., under the assumption of the finite depth of the dependence of the results of physical measurements on the prehistory, which is an adequate approximation of the real situation.The extraction of the output provably random bit sequence from the initial sequence of the results of physical measurements using V F Babkin's effective arithmetic coding method is demonstrated.It is shown that random bit sequences can be provably obtained even from primary sequences of the results of physical measurements, which are dependent on (correlated to) any finite depth (prehistory).We aim to reveal the connection of various approximations employed in the development and description of methods for obtaining random bit sequences with the basic physical limitations of Nature.The mathematical proofs are detailed to the level of practical algorithms applied in real random number generators.The necessary mathematical propositions are presented at an intuitive level for physicists, do not require prior knowledge in this area, and are comprehensible to undergraduate university students.