How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Large sets in AC0 have many strings with low Kolmogorov complexity
Information Processing Letters
Complexity theory retrospective II
Complexity theory retrospective II
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
Resource bounded randomness and computational complexity
Theoretical Computer Science
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Handbook of Applied Cryptography
Handbook of Applied Cryptography
| Hi-index | 5.23 |
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic information theory) and pseudorandom strings (from cryptography). For example, we show that we can easily distinguish a complexity-theoretic pseudorandom ensemble from the uniform ensemble. Both notions of pseudorandom strings are uniformly unpredictable; in contrast with pseudorandom strings, complexity-theoretic pseudorandom strings are not polynomial-time unpredictable.