Construction of extractors using pseudo-random generators (extended abstract)
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 141-148
- https://doi.org/10.1145/301250.301289
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Extracting Randomness: A Survey and New ConstructionsJournal of Computer and System Sciences, 1999
- Free Bits, PCPs, and Nonapproximability---Towards Tight ResultsSIAM Journal on Computing, 1998
- Explicit OR-dispersers with polylogarithmic degreeJournal of the ACM, 1998
- On Unapproximable Versions of $NP$-Complete ProblemsSIAM Journal on Computing, 1996
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- BPP has subexponential time simulations unlessEXPTIME has publishable proofscomputational complexity, 1993
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Generating quasi-random sequences from semi-random sourcesJournal of Computer and System Sciences, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984