Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Sparse pseudorandom distributions (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
Deterministic Hypergraph Coloring and Its Applications
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Cryptographic Primitives Based on Hard Learning Problems
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Near-Optimal Conversion of Hardness into Pseudo-Randomness
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An optimal lower bound for 2-query locally decodable linear codes
Information Processing Letters
Computational extractors and pseudorandomness
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
| Hi-index | 0.00 |
A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function that is hard for C. This generator reveals an equivalence between the problems of proving lower bounds and the problem of generating good pseudorandom sequences. Combining this construction with other arguments, a number of consequences are obtained.