Pseudorandom Generators without the XOR Lemma
Top Cited Papers
- 1 March 2001
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 62 (2) , 236-266
- https://doi.org/10.1006/jcss.2000.1730
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Extracting Randomness: A Survey and New ConstructionsJournal of Computer and System Sciences, 1999
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Natural ProofsJournal of Computer and System Sciences, 1997
- Simulating BPP using a general weak random sourceAlgorithmica, 1996
- On the hardness of computing the permanent of random matricescomputational complexity, 1996
- Randomness is Linear in SpaceJournal of Computer and System Sciences, 1996
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- BPP has subexponential time simulations unlessEXPTIME has publishable proofscomputational complexity, 1993
- How to construct random functionsJournal of the ACM, 1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984