Near-optimal conversion of hardness into pseudo-randomness
暂无分享,去创建一个
Avi Wigderson | Russell Impagliazzo | Ronen Shaltiel | R. Impagliazzo | A. Wigderson | Ronen Shaltiel
[1] Noam Nisan,et al. Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[2] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[3] Avi Wigderson,et al. Hardness vs. Randomness (Extended Abstract) , 1988, FOCS 1988.
[4] José D. P. Rolim,et al. Weak random sources, hitting sets, and BPP simulations , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[5] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[6] Luca Trevisan,et al. Construction of extractors using pseudo-random generators (extended abstract) , 1999, STOC '99.
[7] Amnon Ta-Shma,et al. Almost Optimal Dispersers , 1998, STOC '98.
[8] José D. P. Rolim,et al. Hitting Sets Derandomize BPP , 1996, ICALP.
[9] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[10] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[11] Russell Impagliazzo,et al. Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[12] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[13] Noam Nisan,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[14] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[15] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma (extended abstract) , 1999, STOC '99.