General Weak Random Sources

  title={General Weak Random Sources},
  author={David Zuckerman},
We consider the following model for a weak random source: the source is asked only once for R bits, and the source outputs an R b i t string such that no string has probability more than 2-6R of being output, for some fixed 6 > 0. We exhibit a pseudo-random generator running in time that simulates RP using as a seed a string from such a source. Under the Generalized Paley Graph conjecture, we give a generator that runs in polynomial time and simulates RP, as well as a different generator that… CONTINUE READING
Highly Cited
This paper has 112 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
73 Citations
12 References
Similar Papers


Publications citing this paper.

113 Citations

Citations per Year
Semantic Scholar estimates that this publication has 113 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…