Pseudorandom generators without the XOR Lemma

Journal of Computer and System Sciences

Volumn 62, Issue 2, 2001, Pages 236-266

  Sudan, Madhu ^a   Trevisan, Luca ^b   Vadhan, Salil ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Columbia University ^*  (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; RANDOM NUMBER GENERATION; THEOREM PROVING;

POLYNOMIAL RECONSTRUCTION; PSEUDORANDOM GENERATORS;

COMPUTATIONAL COMPLEXITY;

EID: 0035276434     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2000.1730     Document Type: Article

References (53)

1. Two theorems on random polynomial time
2. Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
3. Reconstructing algebraic functions from mixed data
4. Improved low degree testing and its applications
5. On resource-bounded measure and pseudorandomness
6. BPP has subexponential time simulations unless EXPTIME has publishable proofs
7. Hiding instances in multioracle queries
8. How to reduce your enemy's information (extended abstract)
9. How to generate cryptographically strong sequences of pseudorandom bits
10. On the hardness of the permanent
11. On the power of two-point based sampling
12. The bit extraction problem or t-resilient functions (preliminary version)
13. Dispersers, deterministic amplification, and weak random sources (extended abstract)
14. On the hardness of computing the permanent of random matrices
15. Random-self-reducibility of complete sets
16. On the bit extraction problem
17. Self-testing correcting for polynomials and for approximate functions
18. Highly resilient correctors for polynomials
19. A computational perspective on sampling (survey)
20. How to construct random functions
21. A hard-core predicate for all one-way functions
22. Probabilistic encryption
23. Improved decoding of Reed-Solomon and algebraic-geometry codes
24. A pseudorandom generator from any one-way function
25. Hard-core distributions for somewhat hard problems
26. Extractors and pseudorandom generators with optimal seed length
27. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma
28. Randomness vs. time: De-randomization under a uniform assumption
29. Graph nonisomorphism has subexponential size proof unless the polynomial-time hierarchy collapses
30. New directions in testing
31. Extracting randomness: A survey and new constructions
32. Hardness vs randomness
33. Randomness is linear in space
34. Natural proofs
35. Computing with very weak random sources
36. Decoding of Reed Solomon codes beyond the error-correction bound
37. Pseudorandom generators without the XOR lemma [abstract]
38. Pseudorandom generators without the XOR lemma [extended abstract]
39. Constructions of near-optimal extractors using pseudo-random generators
40. A theory of the learnable
41. Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slight-random sources (extended abstract)
42. Theory and applications of trapdoor functions (extended abstract)
43. Simulating BPP using a general weak random source
44. Randomness-optimal oblivious sampling