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

Journal of Physics E Scientific Instruments

The generation of truly random binary digits

Jan Havel

Published May 1, 1973• 1 citation
Publisher

Abstract

The Genap III generator has been designed as an accurate, defined source of the random process, and connected with a computer it can be used to generate random processes with continuous as well as discrete time. It is equipped with a physical source of the random process on the one hand, and a pseudorandom linear binary generator on the other. Both generators may be used independently, or their outputs may be mixed.

DOI
10.1088/0022-3735/6/5/026

Related papers

A compact and accurate generator for truly random binary digits

R S Maddocks, S Matthews, E W Walker +1 more

A method is described for the accurate generation of truly random binary digits at kilohertz rates by means of a circuit sufficiently compact to go on to a single printed circuit card. The method uses the odd-even criterion with a Poisson distribution obtained by counting random pulses from an electronic noise source. It appears to be capable of development to give considerably higher speeds.

Journal of Physics E Scientific Instruments•Jun 1, 1972•27 citations

Quantum random number generator for secure communications

Anna Vasilievna Epishkina, Konstantin Kogos

Nowadays information technologies are widespread and used in every computer-based system, hence information security tasks are quite important and their successful solution is required in business process. Cryptographic means are used in different applications, especially in cases when data confidentiality should be provided; although they can be utilized to maintain data availability and integrity, user's anonymity, author's non-repudiation and so on. Many information security tools use random numbers, but unfortunately, quality of output random numbers and speed of their generation do not satisfy modern requirements. The rate of production-run random number generators is limited by the physical processes used. One of the reasons of low random numbers generating rate is application of binary events. Many generators use analog events, e.g. noise in electronic devices, converted to binary numbers utilizing the threshold value or quantum discrete events, e.g. photon passing through the polarizer. The main idea of this work is that one can increase random number generator's rate using the non-binary sequences, e.g. non-binary quantum processes.

International Siberian Conference on Control and Communications•May 1, 2016•3 citations

RANDOM DIGIT GENERATION WITH A NOISE SOURCE AND COUNTER

K. A. Steele

A method of generating random decimal digits with commercially available equipment is described and the effect of operating parameters on the randomness of the digits is discussed. A figure of merit is obtained for the generated sequence which is based on the relative entropies of the actual source and a hypothetical ideal source.

Canadian Journal of Physics•Jul 1, 1962•0 citations

Reply to "The generation of truly random binary digits"

C.H. Vincent

Journal of Physics E Scientific Instruments•May 1, 1973•0 citations

Truly random number generation: an example

Daniela Frauchiger, Renato Renner

Randomness is crucial for a variety of applications, ranging from gambling to computer simulations, and from cryptography to statistics. However, many of the currently used methods for generating randomness do not meet the criteria that are necessary for these applications to work properly and safely. A common problem is that a sequence of numbers may look random but nevertheless not be truly random. In fact, the sequence may pass all standard statistical tests and yet be perfectly predictable. This renders it useless for many applications. For example, in cryptography, the predictability of a randomly" chosen password is obviously undesirable. Here, we review a recently developed approach to generating true | and hence unpredictable | randomness.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 29, 2013•2 citations

Can Machine Learning Distinguish Pseudorandom from Entropy-Backed Randomness? An Experimental Study

Hrithwika Srihari

Randomness is a scarce and precious resource: cryptography, scientific simulation, gambling regulation, and even foundational physics all depend on being able to produce numbers that no one — not even the generator itself — could have predicted in advance. Classical computers cannot create such numbers on their own, because they are deterministic machines; every pseudorandom number generator (PRNG) is, in principle, a fixed algorithm whose entire output is fixed the moment a seed is chosen. Quantum random number generators (QRNGs) promise something categorically different: unpredictability guaranteed by the indeterminism of quantum measurement itself. This paper examines whether “true” randomness is achievable at all, surveys the physical arguments (rooted in Bell's theorem) that quantum measurement outcomes are not merely unknown but undetermined, and then asks a narrower, more computational question: can a machine-learning model tell the difference between the output of a well-designed PRNG and genuine entropy? We built and tested a small experimental pipeline comparing a deliberately flawed linear-congruential generator, a mildly weak variant, two industry-standard PRNGs (Mersenne Twister and PCG64), and operating-system entropy (as an accessible proxy for physically-sourced randomness). Gradient-boosted and logistic-regression classifiers detected the flawed generator with 100% accuracy but could not beat chance (49–51%) against modern PRNGs, mirroring published results in the cryptographic and quantum-optics literature. We conclude that while true randomness is very plausibly achievable through quantum processes certified by Bell-inequality violation, no black-box statistical or machine-learning test — however sophisticated — can, on principle, certify the difference between a good PRNG and true randomness from output alone; the distinction is one of provenance and physical mechanism, not detectable pattern.

•Sep 14, 2026•0 citations
The Genap III generator has been designed as an accurate, defined source of the random process, and connected with a computer it can be used to generate random processes with continuous as well as discrete time. It is equipped with a physical source of the random process on the one hand, and a pseudorandom linear binary generator on the other. Both generators may be used independently, or their outputs may be mixed.
Nowadays information technologies are widespread and used in every computer-based system, hence information security tasks are quite important and their successful solution is required in business process. Cryptographic means are used in different applications, especially in cases when data confidentiality should be provided; although they can be utilized to maintain data availability and integrity, user's anonymity, author's non-repudiation and so on. Many information security tools use random numbers, but unfortunately, quality of output random numbers and speed of their generation do not satisfy modern requirements. The rate of production-run random number generators is limited by the physical processes used. One of the reasons of low random numbers generating rate is application of binary events. Many generators use analog events, e.g. noise in electronic devices, converted to binary numbers utilizing the threshold value or quantum discrete events, e.g. photon passing through the polarizer. The main idea of this work is that one can increase random number generator's rate using the non-binary sequences, e.g. non-binary quantum processes.
Randomness is crucial for a variety of applications, ranging from gambling to computer simulations, and from cryptography to statistics. However, many of the currently used methods for generating randomness do not meet the criteria that are necessary for these applications to work properly and safely. A common problem is that a sequence of numbers may look random but nevertheless not be truly random. In fact, the sequence may pass all standard statistical tests and yet be perfectly predictable. This renders it useless for many applications. For example, in cryptography, the predictability of a randomly" chosen password is obviously undesirable. Here, we review a recently developed approach to generating true | and hence unpredictable | randomness.
Randomness is a scarce and precious resource: cryptography, scientific simulation, gambling regulation, and even foundational physics all depend on being able to produce numbers that no one — not even the generator itself — could have predicted in advance. Classical computers cannot create such numbers on their own, because they are deterministic machines; every pseudorandom number generator (PRNG) is, in principle, a fixed algorithm whose entire output is fixed the moment a seed is chosen. Quantum random number generators (QRNGs) promise something categorically different: unpredictability guaranteed by the indeterminism of quantum measurement itself. This paper examines whether “true” randomness is achievable at all, surveys the physical arguments (rooted in Bell's theorem) that quantum measurement outcomes are not merely unknown but undetermined, and then asks a narrower, more computational question: can a machine-learning model tell the difference between the output of a well-designed PRNG and genuine entropy? We built and tested a small experimental pipeline comparing a deliberately flawed linear-congruential generator, a mildly weak variant, two industry-standard PRNGs (Mersenne Twister and PCG64), and operating-system entropy (as an accessible proxy for physically-sourced randomness). Gradient-boosted and logistic-regression classifiers detected the flawed generator with 100% accuracy but could not beat chance (49–51%) against modern PRNGs, mirroring published results in the cryptographic and quantum-optics literature. We conclude that while true randomness is very plausibly achievable through quantum processes certified by Bell-inequality violation, no black-box statistical or machine-learning test — however sophisticated — can, on principle, certify the difference between a good PRNG and true randomness from output alone; the distinction is one of provenance and physical mechanism, not detectable pattern.