Pseudo-random generators for all hardnesses

Journal of Computer and System Sciences

Volumn 67, Issue 2, 2003, Pages 419-440

  Umans, Christopher ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Complexity classes; Derandomization; Low degree extension; Pseudo random number generators

Indexed keywords

ALGORITHMS; COMPUTER CIRCUITS; COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); FUNCTIONS; RANDOM NUMBER GENERATION; RANDOM PROCESSES; THEOREM PROVING;

COMPLEXITY CLASSES; DERANDOMIZATION; LOW DEGREE EXTENSION; PSEUDO-RANDOM NUMBER GENERATORS;

COMPUTATIONAL COMPLEXITY;

EID: 0142027847     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00046-1     Document Type: Article

References (27)

1. A. Andreev, A. Clementi, J. Rolim, A new general derandomization method, J. ACM 45 (1) (1998).
2. A.E. Andreev, A.E.F. Clementi, J.D.P. Rolim, L. Trevisan, Weak random sources, hitting sets, and BPP simulations, in: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 20-22 October, IEEE, New York, 1997, pp. 264-272.
3. L. Babai, L. Fortnow, N. Nisan, A. Wigderson, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Comput. Complexity 3 (4) (1993) 307-318.
4. M. Bellare, J. Rompel, Randomness-efficient oblivious sampling, in: 35th Annual Symposium on Foundations of Computer Science, 1994.
5. M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Comput. 13 (4) (1984) 850-864.
6. O. Goldreich, S. Vadhan, A. Wigderson, Simplified derandomization of BPP using a hitting set generator, Technical Report TR00-004, Electronic Colloquium on Computational Complexity, January 2000.
7. V. Guruswami, M. Sudan, List decoding algorithms for certain concatenated codes, in: Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
8. V. Guruswami, M. Sudan, Extensions to the Johnson bound, Manuscript, February 2001.
9. R. Impagliazzo, Hard-core distributions for somewhat hard problems. In 36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, 23-25 October, IEEE, New York, 1995, pp. 538-545.
10. R. Impagliazzo, V. Kabanets, A. Wigderson, In search of an easy witness: Exponential time vs. probabilistic polynomial time, in: Sixteenth Annual IEEE Conference on Computational Complexity, 2001, pp. 1-12
11. J. Comput. System Sci., to appear.
12. R. Impagliazzo, R. Shaltiel, A. Wigderson, Near-optimal conversion of hardness into pseudo-randomness, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999.
13. R. Impagliazzo, R. Shaltiel, A. Wigderson, Extractors and pseudo-random generators with optimal seed-length, in: Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, 21-23 May 2000.
14. R. Impagliazzo, A. Wigderson, P = BPP if E requires exponential circuits: Derandomizing the XOR lemma, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, Texas, 4-6 May 1997, pp. 220-229.
15. V. Kabanets, Easiness assumptions and hardness tests: Trading time for zero error, J. Comput. System Sci. 63 (2) (2001) 236-252.
16. A.R. Klivans, D. van Melkebeek, Graph nonisomorphism has subexponential size proofs unless the polynomial-times hierarchy collapses, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, SIAM J. Comput., to appear.
17. S. Lang, Algebra, 3rd Edition, Addison-Wesley, Reading, MA, 1993.
18. C.J. Lu, Derandomizing Arthur-Merlin games under uniform assumptions, Comput. Complexity 10 (3) (2001) 247-259.
19. P.B. Miltersen, N.V. Vinodchandran, Derandomizing Arthur-Merlin games using hitting sets, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999.
20. N. Nisan, A. Wigderson, Hardness vs randomness, J. Comput. System Sci. 49 (2) (1994) 149-167.
21. R. Shaltiel, C. Umans, Simple extractors for all min-entropies and a new pseudo-random generator, in: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 648-657.
22. M. Sudan, Decoding of Reed Solomon codes beyond the error-correction bound, J. Complexity 13 (1997).
23. M. Sudan, L. Trevisan, S. Vadhan, Pseudorandom generators without the XOR lemma, J. Comput. System Sci. 62 (2) (2001) 236-266.
24. A. Ta-Shma, D. Zuckerman, S. Safra, Extractors from Reed-Muller codes, in: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.
25. L. Trevisan, Extractors and pseudorandom generators, J. ACM 48 (4) (2001) 860-879.
26. R. Urbanke, Modern coding theory-SS2001, Technical Report DSC-LTHC, EPFL, 2001, Available from http://lthcwww.epfl.ch/content.php?title=coding2001.
27. A.C. Yao, Theory and applications of trapdoor functions (extended abstract), in: 23rd Annual Symposium on Foundations of Computer Science, Chicago, IL, 3-5 November, IEEE, New York, 1982, pp. 80-91.