Reducing the seed length in the Nisan-Wigderson generator

Combinatorica

Volumn 26, Issue 6, 2006, Pages 647-681

  Impagliazzo, Russell ^a   Shaltiel, Ronen ^b   Wigderson, Avi ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

68Q15

Indexed keywords

EID: 33847321516     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-006-0036-8     Document Type: Article

References (34)

1. A. E. ANDREEV, A. E. F. CLEMENTI and J. D. P. ROLIM: Hitting sets derandomize BPP, in Friedhelm Meyer auf der Heide and Burkhard Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, volume 1099 of Lecture Notes in Computer Science, pages 357-368, Paderborn, Germany, 8-12 July 1996, Springer-Verlag.
2. A. E. ANDREEV, A. E. F. CLEMENTI, J. D. P. ROLIM and L. TREVISAN: Weak random sources, hitting sets, and BPP simulations, SIAM Journal on Computing 28(6) (1999), 2103-2116.
3. L. BABAI, L. FORTNOW, N. NISAN and A. WIGDERSON: BPP has subexponential time simulations unless EXPTIME has publishable proofs, Computational Complexity 3(4) (1993), 307-318.
4. M. BLUM: Independent unbiased coin flips from a correlated biased source - A finite state Markov chain, Combinatorica 6(2) (1986), 97-108.
5. M. BLUM and S. MICALI: How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal on Computing 13(4) (1984), 850-864.
6. B. CHOR and O. GOLDREICH: On the power of two-point based sampling, Journal of Complexity 5(1) (1989), 96-106.
7. J. Y. CAI, A. NERURKAR and D. SIVAKUMAR: Hardness and hierarchy theorems for probabilistic quasi-polynomial time, in Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 726-735, 1999.
8. S. GOLDWASSER and S. MICALI: Probabilistic encryption, Journal of Computer and System Sciences 28(2) (1984), 270-299.
9. O. GOLDREICH: Modern Cryptography, Probabilistic Proofs and Pseudorandomness, Springer-Verlag, Algorithms and Combinatorics, 1998.
10. R. IMPAGLIAZZO: Hard-core distributions for somewhat hard problems, in 36th Annual Symposium on Foundations of Computer Science, pages 538-545, Milwaukee, Wisconsin, 23-25 October 1995, IEEE.
11. R. IMPAGLIAZZO, R. SHALTIEL and A. WIGDERSON: Near-optimal conversion of hardness into pseudo-randomness, in 40th Annual Symposium on Foundations of Computer Science: October 17-19, 1999, New York City, New York, pages 181-190, 1999.
12. R. IMPAGLIAZZO, R. SHALTIEL and A. WIGDERSON: Extractors and pseudo-random generators with optimal seed length, in Proceedings of the thirty second annual ACM Symposium on Theory of Computing: Portland, Oregon, May 21-23, 2000, pages 1-10, 2000.
13. R. IMPAGLIAZZO and A. WIGDERSON: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma, in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 220-229, El Paso, Texas, 4-6 May 1997.
14. R. IMPAGLIAZZO and A. WIGDERSON: Randomness vs time: Derandomization under a uniform assumption, Journal of Computer and System Sciences 63(4) (2001), 672-688.
15. A. R. KLIVANS and D. VAN MELKEBEEK: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses, SIAM Journal on Computing 31(5) (2002), 1501-1526.
16. C. J. LU, O. REINGOLD, S. VADHAN and A. WIGDERSON: Extractors: optimal up to constant factors, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 602-611, 2003.
17. N. NISAN: Extracting randomness: How and why: A survey, in Proceedings, Eleventh Annual IEEE Conference on Computational Complexity, pages 44-58, Philadelphia, Pennsylvania, 24-27 May 1996, IEEE Computer Society Press.
18. N. NISAN and A. TA-SHMA: Extracting randomness: A survey and new constructions, Journal of Computer and System Sciences 58(1) (1999), 148-173.
19. N. NISAN and A. WIGDERSON: Hardness vs randomness, Journal of Computer and System Sciences 49(2) (1994), 149-167.
20. N. NISAN and D. ZUCKERMAN: Randomness is linear in space, Journal of Computer and System Sciences 52(1) (1996), 43-52.
21. R. RAZ, O. REINGOLD and S. VADHAN: Error reduction for extractors, in 40th Annual Symposium on Foundations of Computer Science: October 17-19, 1999, New York City, New York, pages 191-201, 1999.
22. R. RAZ, O. REINGOLD and S. VADHAN: Extracting all the randomness and reducing the error in Trevisan's extractors, Journal of Computer and System Sciences 65(1) (2002), 97-128.
23. O. REINGOLD, R. SHALTIEL and A. WIGDERSON: Extracting randomness via repeated condensing, in 41st Annual Symposium on Foundations of Computer Science: proceedings: 12-14 November, 2000, Redondo Beach, California, pages 22-31, 2000.
24. J. RADHAKRISHNAN and A. TA-SHMA: Bounds for dispersers, extractors, and depth-two superconcentrators; SIAM Journal on Discrete Mathematics 13(1) (2000), 2-24.
25. R. SHALTIEL: Recent developments in extractors, Bulletin of the European Association for Theoretical Computer Science 77 (2002), 67-95.
26. M. SUDAN, L. TREVISAN and S. VADHAN: Pseudorandom generators without the XOR lemma, Journal of Computer and System Sciences 62(2) (2001), 236-266.
27. R. SHALTIEL and C. UMANS: Simple extractors for all min-entropies and a new pseudo-random generator, in 42nd IEEE Symposium on Foundations of Computer Science: proceedings: October 14-17, 2001, Las Vegas, Nevada, USA, pages 648-657, 2001.
28. M. SANTHA and U. V. VAZIRANI: Generating quasi-random sequences from semirandom sources, Journal of Computer and System Sciences 33(1) (1986), 75-87.
29. L. TREVISAN: Extractors and pseudorandom generators, Journal of the ACM 48(4) (2001), 860-879.
30. A. TA-SHMA, C. UMANS and D. ZUCKERMAN: Loss-less condensers, unbalanced expanders, and extractors; in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing: Hersonissos, Crete, Greece, July 6-8, 2001, pages 143-152, 2001.
31. C. UMANS: Pseudo-random generators for all hardnesses, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 627-634, 2002.
32. A. WIGDERSON and D. ZUCKERMAN: Expanders that beat the eigenvalue bound: Explicit construction and applications, in Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 245-251, San Diego, California, 16-18 May 1993.
33. A. C. YAO: Theory and applications of trapdoor functions (extended abstract), in 23rd Annual Symposium on Foundations of Computer Science, pages 80-91, Chicago, Illinois, 3-5 November 1982, IEEE.
34. D. ZUCKERMAN: Randomness-optimal oblivious sampling, Random Structures & Algorithms 11(4) (1997), 345-367.