Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a pseudorandom generator from any oneway function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom generator iff there is a one-way function. Warning: Essentially this paper has been published in SIAM Journal on Computing and is hence subject to copyright restrictions. It is for personal use only. 1 Introduction One of the basic primitives in the study of the interaction between randomness and feasible computation is a pseudorandom generator. Intuitively, a pseudorandom generator is a Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden, email Johanh@nada.kth.se. Research supported by the Swedish National Board for Technical Development. y Department of Computer Science, University of California at San Diego. Research partially done wh...
|
2091
|
A method for obtaining digital signatures and public-key cryptosystems
– Rivest, Shamir, et al.
- 1997
|
|
1876
|
New directions in cryptogra-phy
– Diffie, Hellman
- 1976
|
|
1309
|
Randomized algorithms
– Motwani, Raghavan
- 1995
|
|
838
|
Micali: Probabilistic Encryption
– Goldwasser, Silvio
- 1984
|
|
718
|
The knowledge complexity of interactive proof systems
– Goldwasser, Micali, et al.
- 1989
|
|
483
|
How to construct random functions
– GOLDREICH, GOLDWASSER, et al.
- 1986
|
|
468
|
Universal classes of hash functions
– Carter, Wegman
- 1979
|
|
460
|
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits
– Blum, Micali
- 1984
|
|
256
|
Proofs that yield nothing but their validity or all languagesin NP have zero-knowledge proof systems
– Goldreich, Micali, et al.
- 1991
|
|
246
|
Universal One-Way Hash Function and their Cryptographic Applications
– Naor, Yung
- 1989
|
|
206
|
How to construct pseudorandom permutations from pseudorandom functions
– Luby, Rackoff
- 1988
|
|
153
|
One-Way Functions are Necessary and Sufficient for Secure Signatures
– Rompel
- 1990
|
|
140
|
Unbiased bits from sources of weak randomness and probabilistic communication complexity
– Chor, Goldreich
- 1988
|
|
129
|
Privacy amplification by public discussion
– Bennett, Brassard, et al.
- 1988
|
|
100
|
A Public-Key Cryptosystem Based on Algebraic Coding Theory
– McEliece
|
|
99
|
One-Way Function and Pseudorandom Generators
– Levin
- 1987
|
|
83
|
BPP has Subexponential Time Simulations unless EXPTIME has Publishable Proofs
– Babai, Fortnow, et al.
- 1993
|
|
75
|
Fundamental Algorithms, In: The Art of Computer Programming
– Knuth
- 1973
|
|
63
|
Efficient cryptographic schemes provably as secure as subset sum
– Impagliazzo, Naor
- 1989
|
|
54
|
Independent unbiased coin flips from a correlated biased source — a finite state Markov chain
– Blum
- 1986
|
|
53
|
Generating quasi-random sequences from slightly random sources
– Santha, Vazirani
- 1984
|
|
46
|
On the existence of pseudorandom generators
– Goldreich, Krawczyk, et al.
- 1993
|
|
46
|
Random polynomial time is equal to slightly-random polynomial time
– Vazirani, Vazirani
- 1985
|
|
38
|
Bit Commitment using Pseudorandom Generators
– Naor
- 1991
|
|
28
|
Limits on the Provable Consequences of One-Way Functions
– Rudich
- 1988
|
|
26
|
One-Way Functions are Essential for Non-Trivial Zero-Knowledge
– Ostrovsky, Wigderson
- 1993
|
|
25
|
Pseudo-random number generation from oneway functions
– Impagliazzo, Levin, et al.
- 1989
|
|
24
|
Pseudo-random generators and complexity classes
– Boppana, Hirschfeld
- 1989
|
|
21
|
Why and How to Establish a Private Code on a Public Network
– Goldwasser, Micali, et al.
- 1982
|
|
19
|
Inferring sequences produced by pseudo-random number generators
– Boyar
- 1989
|
|
19
|
How to predict congruential generators
– Krawczyk
- 1992
|
|
7
|
Pseudo-random generators under uniform assumptions
– astad, J
- 1990
|
|
5
|
Theory and applications of trapdoor functions, in 23rd annual symposium on foundations of computer science
– Yao
- 1982
|
|
3
|
Three Approaches to the Concept of the Amount
– Kolmogorov
- 1965
|
|
2
|
Cryptography Using Weak Sources of Randomness
– McInnes
- 1987
|
|
2
|
A Complexity Theoretic Approach to Randomness”, 15th STOC
– Sipser
- 1983
|
|
1
|
RSA Rabin Functions
– Alexi, Chor, et al.
- 1988
|
|
1
|
A Hard-Core Predicate for any One-way Function rst
– Goldreich, Levin
- 1989
|
|
1
|
One-way functions are essential for information based cryptography
– Impagliazzo, Luby
- 1989
|
|
1
|
How to recycle random bits, 30 th
– Impagliazzo, Zuckerman
- 1989
|
|
1
|
Probability Th
– Renyi
- 1970
|
|
1
|
A Mathematical Th
– Shannon
- 1948
|
|
1
|
Towards a Strong Communication Complexity Th. or Generating Quasirandom Sequences from Two Communicating Slightly-random Sources
– Vazirani
- 1987
|
|
