A Pseudorandom Generator from any One-way Function
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (4), 1364-1396
- https://doi.org/10.1137/s0097539793244708
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- BPP has subexponential time simulations unlessEXPTIME has publishable proofscomputational complexity, 1993
- A note on computational indistinguishabilityInformation Processing Letters, 1990
- Inferring sequences produced by pseudo-random number generatorsJournal of the ACM, 1989
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- Independent unbiased coin flips from a correlated biased source—A finite state markov chainCombinatorica, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- New directions in cryptographyIEEE Transactions on Information Theory, 1976