Abstract
When constructing uniform random numbers in [0, 1] from the output of a physical device, usually n independent and unbiased bits B j are extracted and combined into the machine number \(Y{\text{ :}} = \sum {_{j = 1}^n {\text{ }}2^{ - j} B_j } \). In order to reduce the number of data used to build one real number, we observe that for independent and exponentially distributed random variables X n (which arise for example as waiting times between two consecutive impulses of a Geiger counter) the variable U n : = X 2n − 1/(X 2n − 1 + X 2n ) is uniform in [0, 1]. In the practical application X n can only be measured up to a given precision ϑ (in terms of the expectation of the X n ); it is shown that the distribution function obtained by calculating U n from these measurements differs from the uniform by less than ϑ/2.
We compare this deviation with the error resulting from the use of biased bits B j with P ε{B j = 1{ = \(\frac{1}{2} + {\varepsilon }\) (where ε ∈] − \(\frac{1}{2},\frac{1}{2}\)[) in the construction of Y above. The influence of a bias is given by the estimate that in the p-total variation norm ‖Q‖TV p = (\(\sum {_\omega ^{} } \)|Q(ω)|p)1/p (p ≥ 1) we have ‖P ε Y − P 0 Y ‖TV p ≤ (c n \(\sqrt n \) · ε)1/p with c n → p \(\sqrt {8/\pi } \) for n → ∞. For the distribution function ‖F ε Y − F 0 Y ‖ ≤ 2(1 − 2−n)|ε| holds.
Similar content being viewed by others
References
Bassham L. and Soto J. 2000. Randomness testing of the advanced encryption standard finalist candidates. Report md20899-8930, National Institute of Standards and Technology, Gaithersburg.
Blum M. 1986. Independent unbiased coin flips from a correlated biased source: A finite state markov chain. Combinatorica 6: 97–108.
Chor B. and Goldreich O. 1988. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2): 230–261.
Feller W. 1970.An Introduction to Probability Theory and its Applications, Vol. 1. John Wiley & Sons, New York.
Inoue H., Kumahora H., Yoshizawa Y., Ichimura M., and Miyatake O. 1983. Random numbers generated by a physical device. Appl. Statist. 32(2): 115–120.
L'Ecuyer P. 1990. Discrete event simulation. Comm. ACM 33(10): 86–97.
Marsaglia G. 1968. Random numbers fall mainly in the planes. Proc. Nat. Acad. Sci. 61: 25–28.
Nisley E. 1990. Basic radioactive randoms. Circuit Cellar Ink. 58–68.
Richter M. 1993. PURAN 2: Ein Zufallsgenerator zur Erzeugung von quasi-idealen Zufallszahlen aus elektronischem Rauschen Vol. 41 of Informatik aktuell. Springer, Berlin, pp. 49–62.
Ritter T. 1997. Random Number Machines: A Literature Survey. Ritter Software Engineering, http://www.io.com/~ritter/RES/RNGMACH.HTM.
Rukhin A.L. 2001. Testing randomness: A suite of statistical procedures. Theory Prob. Appl. 45(1): 111–132.
Santha M. and Vazirani U.V. 1984. Generating quasi-random sequences from slightly random sources. In Proc. 25th IEEE Symposium on the Foundations of Computer Science, pp. 434–440.
Schneier B. 1996. Applied Cryptography. Addison-Wesley, Reading.
von Neumann J. 1963. Various techniques used in connection with random digits. In von Neumann's CollectedWorks, Vol. 5, Pergamon Press, Elmsford, NY, pp. 768–770.
Walker J. 1996. HotBits: Genuine random numbers, generated by radioactive decay. Fourmilab, http://www.fourmilab.ch/hotbits.
Zieliński R. 1978. Erzeugung von Zufallszahlen. Verlag Harri Deutsch, Bremen.
Rights and permissions
About this article
Cite this article
Neuenschwander, D., Zeuner, H. Generating random numbers of prescribed distribution using physical sources. Statistics and Computing 13, 5–11 (2003). https://doi.org/10.1023/A:1021999708104
Issue Date:
DOI: https://doi.org/10.1023/A:1021999708104