General weak random sources

The following model for a weak random source is considered. The source is asked only once for R bits, and the source outputs an R-bit string such that no string has probability more than 2/sup - delta R/ of being output. for some fixed delta >0. A pseudorandom generator that runs in time n/sup O(...

Full description

Saved in:
Bibliographic Details
Published inFoundations of Computer Science, 31st Symposium pp. 534 - 543 vol.2
Main Author Zuckerman, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Character generation
Computational modeling
Computer science
Computer simulation
Diodes
Entropy
Physics computing
Polynomials
Random number generation
Upper bound
Online AccessGet full text
ISBN081862082X
9780818620829
DOI10.1109/FSCS.1990.89574

Cover

More Information
Summary:The following model for a weak random source is considered. The source is asked only once for R bits, and the source outputs an R-bit string such that no string has probability more than 2/sup - delta R/ of being output. for some fixed delta >0. A pseudorandom generator that runs in time n/sup O(log n)/ and simulates RP using as a seed a string from such a source is exhibited. Under the generalized Paley graph conjecture, a generator that runs in polynomial time and simulates RP is given, as well as a different generator that produces almost perfectly random bits at a rate arbitrarily close to optimal using as seeds strings from a constant number of independent weak random sources.< >
ISBN:081862082X
9780818620829
DOI:10.1109/FSCS.1990.89574