A comparison of two approaches to pseudorandomness

DOI10.1016/S0304-3975(01)00311-5zbMath1002.68071MaRDI QIDQ1605323

Yongge Wang

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexitypseudorandom generatorsunpredictability

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity
• Resource bounded randomness and computational complexity
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Simple Unpredictable Pseudo-Random Number Generator
• On the Length of Programs for Computing Finite Binary Sequences
• A formal theory of inductive inference. Part I

This page was built for publication: A comparison of two approaches to pseudorandomness