Pseudorandom generator from any one-way function

SIAM Journal on Computing

Volumn 28, Issue 4, 1999, Pages 1364-1396

  Håstad, Johan ^a   Impagliazzo, Russell ^b   Levin, Leonid A ^c   Luby, Michael ^d  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c BOSTON UNIVERSITY   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CRYPTOGRAPHY; FUNCTIONS; STATISTICAL METHODS;

COMPLEXITY THEORY; ONE WAY FUNCTION; PSEUDORANDOM GENERATOR;

POLYNOMIALS;

EID: 0345253860     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793244708     Document Type: Article

References (47)

1. W. ALEXI, B. CHOR, O. GOLDREICH, AND C. P. SCHNORR, RSA and Rabin functions: Certain parts are as hard as the whole, SIAM J. Comput., 17 (1988), pp. 194-209.
2. L. BABAI, L. FORTNOW, N. NISAN, AND A. WIGDERSON, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Comput. Complexity, 3 (1993), pp. 307-318.
3. C. H. BENNETT, G. BRASSARD, AND J.-M. ROBERT, Privacy amplification by public discussion, SIAM J. Comput., 17 (1988), pp. 210-229.
4. M. BLUM, Independent unbiased coin flips from a correlated biased source - a finite state Markov chain, Combinatoria, 6 (1986), pp. 97-108.
5. M. BLUM AND S. MICALI, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Comput., 13 (1984), pp. 850-864.
6. R. BOPPANA AND R. HIRSCHFELD, Pseudo-random generators and complexity classes, in Advances in Comp. Research 5, S. Micali, ed., JAI Press, Greenwich, CT, 1989, pp. 1-26.
7. J. BOYAR, Inferring sequences produced by pseudo-random number generators, J. Assoc. Comput. Mach., 36 (1989), pp. 129-141.
8. L. CARTER AND M. WEGMAN, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp. 143-154.
9. B. CHOR AND O. GOLDREICH, Unbiased bits from sources of weak randomness and probabilistic communication complex, SIAM J. Comput., 17 (1988), pp. 230-261.
10. D. DIFFIE AND M. HELLMAN, New directions in cryptography, IEEE Trans. Inform. Theory, 22 (1976), pp. 644-654.
11. O. GOLDREICH, A note on computational indistinguishability, Inform. Process. Lett., 34 (1990), pp. 277-281.
12. O. GOLDREICH, S. GOLDWASSER, AND S. MICALI, How to construct random functions, J. Assoc. Comput. Mach., 33 (1986), pp. 792-807.
13. O. GOLDREICH, H. KRAWCZYK, AND M. LUBY, On the existence of pseudorandom generators, SIAM J. Comput., 22 (1993), pp. 1163-1175.
14. O. GOLDREICH AND L. A. LEVIN, A hard-core predicate for any one-way function, in Proc. 21st ACM Sympos. on Theory of Computing, ACM, New York, 1989, pp. 25-32.
15. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, Proofs that yield nothing but their validity, or all languages in NP have zero-knowledge proofs, J. Assoc. Comput. Mach., 38 (1991), pp. 691-729.
16. S. GOLDWASSER AND S. MICALI, Probabilistic encryption, J. Comput. System Sci., 28 (1984), pp. 270-299.
17. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proof systems, SIAM J. Comput., 18 (1989), pp. 186-208.
18. S. GOLDWASSER, S. MICALI, AND P. TONG, Why and how to establish a private code on a public network, in Proc. 23rd IEEE Sympos. on Found. of Comput. Sci., IEEE, New York, 1982, pp. 134-144.
19. J. HÅSTAD, Pseudo-random generators under uniform assumptions, in Proc. 22nd ACM Sympos. on Theory of Computing, ACM, New York, 1990, pp. 395-404.
20. A. HERZBERG AND M. LUBY, Public randomness in cryptography, in Advances in Cryptology, Proc. 12th Annual Cryptology Conf. (CRYPTO '92), Santa Barbara, CA, 1992, Lecture Notes in Comput. Sci. 740, Springer-Verlag, Berlin, 1993, pp. 421-432.
21. R. IMPAGLIAZZO AND M. LUBY, One-way functions are essential for information based cryptography, in Proc. 30th IEEE Sympos. on Found. of Comput. Sci., IEEE, New York, 1989, pp. 230-235.
22. R. IMPAGLIAZZO, L. LEVIN, AND M. LUBY, Pseudo-random number generation from one-way functions, in Proc. 21st ACM Sympos. on Theory of Computing, ACM, New York, 1989, pp. 12-24.
23. R. IMPAGLIAZZO AND M. NAOR, Efficient cryptographic schemes provably as secure as subset sum, J. Cryptology, 9 (1996), pp. 192-216.
24. R. IMPAGLIAZZO AND S. RUDICH, Limits on the provable consequences of one-way functions, in 21st ACM Sympos. on Theory of Computing, ACM, New York, 1989, pp. 44-56.
25. R. IMPAGLIAZZO AND D. ZUCKERMAN, How to recycle random bits, in Proc. 30th IEEE Sympos. on Found. of Comput. Sci., IEEE, New York, 1989, pp. 248-253.
26. D. E. KNUTH, The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 3rd ed., Addison-Wesley, Bonn, 1998.
27. A. N. KOLMOGOROV, Three approaches to the concept of the amount of information, Problems Inform Transmission, 1 (1965), pp. 1-7.
28. H. KRAWCZYK, How to predict congruential generators, J. Algorithms, 13 (1992), pp. 527-545.
29. L. A. LEVIN, One-way function and pseudorandom generators, Combinatorica, 7 (1987), pp. 357-363.
30. L. A. LEVIN, Randomness and non-determinism, J. Symbolic Logic, 58 (1993), pp.1102-1103.
31. M. LUBY, Pseudorandomness and Cryptographic Applications, Princeton Computer Science Notes, Princeton University Press, Princeton, NJ, 1996.
32. M. LUBY AND C. RACKOFF, How to construct pseudorandom permutations from pseudorandom functions, SIAM J. Comput., 17 (1988), pp. 373-386.
33. R. J. MCELIECE, A Public Key Cryptosystem Based on Algebraic Coding Theory, DSN Progress report, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, 1978.
34. J. MCINNES, Cryptography Using Weak Sources of Randomness, Tech. report 194/87, University of Toronto, 1987.
35. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
36. M. NAOR, Bit commitment using pseudorandom generators, J. Cryptology, 4 (1991), pp. 151-158.
37. M. NAOR AND M. YUNG, Universal one-way hash functions and their applications, in Proc. 21st ACM Sympos. on Theory of Computing, ACM, New York, 1989, pp. 33-43.
38. R. OSTROVSKY AND A. WIGDERSON, One-way functions are essential for non-trivial zero-knowledge, in Proc. 2nd Israel Sympos. on the Theory of Computing and Systems, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 3-17.
39. A. RENYI, Probability Theory, North-Holland, Amsterdam, 1970.
40. R. RIVEST, A. SHAMIR, AND L. ADLEMAN, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), pp. 120-126.
41. J. ROMPEL, One-way functions are necessary and sufficient for secure signatures, in Proc. 22nd ACM Sympos. on Theory of Computing, ACM, New York, 1990, pp. 387-394.
42. M. SANTHA AND U. VAZIRANI, Generating quasi-random sequences from slightly-random sources, J. Comput. System Sci., 33 (1986), pp. 75-87.
43. C. SHANNON, A mathematical theory of communication, Bell System Tech. J., 27 (1948), pp. 379-423; 623-656.
44. M. SIPSER, A complexity theoretic approach to randomness, in Proc. 15th ACM Sympos. on Theory of Computing, ACM New York, 1983, pp. 330-335.
45. U. VAZIRANI, Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources, Combinatorica, 7 (1987), pp. 375-392.
46. U. VAZIRANI AND V. VAZIRANI, Random polynomial time is equal to slightly-random polynomial time, in Proc. 26th IEEE Sympos. on Found. of Comput. Sci., IEEE, New York, 1985, pp. 417-428.
47. A. C. YAO, Theory and applications of trapdoor functions, in Proc. 23rd IEEE Sympos. on Found. of Comput. Sci., IEEE, New York, 1982, pp. 80-91.