Pseudo-random generators for all hardnesses
- 1 September 2003
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 67 (2) , 419-440
- https://doi.org/10.1016/s0022-0000(03)00046-1
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Randomness-efficient oblivious samplingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Weak random sources, hitting sets, and BPP simulationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Hard-core distributions for somewhat hard problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Extractors and pseudo-random generators with optimal seed lengthPublished by Association for Computing Machinery (ACM) ,2000
- List decoding algorithms for certain concatenated codesPublished by Association for Computing Machinery (ACM) ,2000
- Near-optimal conversion of hardness into pseudo-randomnessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- A new general derandomization methodJournal of the ACM, 1998
- P = BPP if E requires exponential circuitsPublished by Association for Computing Machinery (ACM) ,1997
- BPP has subexponential time simulations unlessEXPTIME has publishable proofscomputational complexity, 1993
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984