Generating Quasi-Random Sequences From Slightly-Random Sources
- 25 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 434-440
- https://doi.org/10.1109/sfcs.1984.715945
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- Coin flipping by telephone a protocol for solving impossible problemsACM SIGACT News, 1983
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- How to generate cryptographically strong sequences of pseudo random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Probabilistic encryption & how to play mental poker keeping secret all partial informationPublished by Association for Computing Machinery (ACM) ,1982
- A General Approach for Generating Natural Random VariablesIEEE Transactions on Computers, 1970