Name
Abstract | ||
|---|---|---|
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a pseudorandom generator from any one-way function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom generator if and only if there is a one-way function. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1137/S0097539793244708 | SIAM J. Comput. |
Keywords | Field | DocType |
one-way function,pseudorandom generator,pseudo random generator,cryptography,one way function | Pseudorandom function family,Discrete mathematics,Pseudorandom generators for polynomials,Lavarand,Pseudorandomness,Algorithm,Self-shrinking generator,Random seed,Pseudorandom generator,Pseudorandom generator theorem,Mathematics | Journal |
Volume | Issue | ISSN |
28 | 4 | 0097-5397 |
Citations | PageRank | References |
693 | 43.91 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johan Håstad | 1 | 3586 | 557.23 |
| Russell Impagliazzo | 2 | 5444 | 482.13 |
| Leonid A. Levin | 3 | 2031 | 349.38 |
| Michael Luby | 4 | 9010 | 1319.35 |