Simple extractors for all min-entropies and a new pseudo-random generator

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 648-657

  Shaltiel, Ronen ^a   Umans, Christopher ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING;

PSEUDO-RANDOM GENERATORS (PRG);

RANDOM PROCESSES;

EID: 0035175916     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2001.959941     Document Type: Article

References (43)

1. Hitting sets derandomize BPP
2. A new general derandomization method
3. Weak random sources, hitting sets, and BPP simulations
4. On resource-bounded measure and pseudorandomness
5. BPP has subexponential time simulations unless EXPTIME has publishable proofs
6. Randomness-efficient oblivious sampling
7. How to generate cryptographically strong sequences of pseudo-random bits
8. A hard-core predicate for all one-way functions
9. List decoding algorithms for certain concatenated codes
10. Hard-core distributions for somewhat hard problems
11. In search of an easy witness: Exponential time vs. probabilistic polynomial time
12. Near-optimal conversion of hardness into pseudo-randomness
13. Extractors and pseudo-randomn generators with optimal seed-length
14. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma
15. Easiness assumptions and hardness tests: Trading time for zero error
16. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
17. Derandomizing arthur-merlin games under uniform assumptions
18. Hardness vs randomness
19. Randomness is linear in space
20. Tight bounds for depth-two superconcentrators
21. Error reduction for extractors
22. Extracting all the randomness and reducing the error in trevisan's extractors
23. Extracting randomness via repeated condensing
24. Perfect-information leader election in log* n + O(1) rounds
25. Searching for primitive roots in finite fields
26. On finding primitive roots in finite fields
27. Expanders, randomness, or time versus space
28. Computing with very weak random sources
29. Decoding of reed solomon codes beyond the error-correction bound
30. Pseudorandom generators without the xor lemma
31. On extracting randomness from weak random sources
32. Loss-less condensers, unbalanced expanders, and extractors
33. Extractor codes
34. Construction of extractors using pseudorandom generators
35. p minimization problems
36. Expanders that beat the eigenvalue bound: Explicit construction and applications
37. Theory and applications of trapdoor functions (extended abstract)
38. On unapproximable versions of NP-complete problems
39. Randomness-optimal oblivious sampling