How to construct random functions
Oded Goldreich, Shafi Goldwasser, Silvio M. Micali · Journal of the ACM · 1986
A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented. This generator is a deterministic polynomial-time algorithm that transforms pairs ( g , r ), where g is any one-way function and r is a random k -bit string, to polynomial-time computable functions ƒ r : {1, … , 2 k } → {1, … , 2 k }. These ƒ r 's cannot be distinguished from random functions by any probabilistic polynomial-time algorithm that asks and receives the value of a function at arguments of its choice. The result has applications in cryptography, random constructions, and complexity theory.
Cited by 2,115 works. doi:10.1145/6490.6503 Open-access PDF
Authors
References
- The Art of Computer Programming
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- A method for obtaining digital signatures and public-key cryptosystems
- DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Theory and application of trapdoor functions
- A formal theory of inductive inference. Part II
- The definition of random sequences
- A Simple Unpredictable Pseudo-Random Number Generator