Generating Quasi-Random Sequences From Slightly-Random Sources

Authors:
M. Santha;U. V. Vazirani
Affiliations:
University of California;-
Venue:
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Year:
1984

Citing 0
Cited 9

Adi Shamir: On the Universality of the Next Bit Test

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors

Journal of the ACM (JACM)
Two-source extractors secure against quantum adversaries

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Extracting Kolmogorov complexity with applications to dimension zero-one laws

Information and Computation
Randomized quicksort and the entropy of the random source

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Computational complexity since 1980

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Extracting kolmogorov complexity with applications to dimension zero-one laws

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Distributed computing with imperfect randomness

DISC'05 Proceedings of the 19th international conference on Distributed Computing
Certifiable quantum dice: or, true random number generation secure against quantum adversaries

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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.