The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1984)
Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
ISBN: 0-8186-0591-X
pp: 434-440
M. Santha , University of California
Several applications require truly random bit sequences, whereas physical sources of randomness are at best imperfect. We consider a general model for these slightly-random sources (e,g. zener diodes), and show how to convert their output into 'random looking ' sequences, which we call quasi -random. We show that quasi-random sequences are indistinguishable from truly random ones in a strong sense. This enables us to prove that quasi-random sequences can be used in place of truly random ones for applications such as seeds for pseudo-random number generators, randomizing algorithms, and stochastic simulation experiments.
U.V. Vazirani, M. Santha, "Generating Quasi-Random Sequences From Slightly-Random Sources", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 434-440, 1984, doi:10.1109/SFCS.1984.715945
210 ms
(Ver 3.3 (11022016))