A note on Yao's theorem about pseudo-random generators

DOI10.1007/s12095-011-0047-1zbMath1235.94045OpenAlexW2094527196MaRDI QIDQ662183

Robert Rolland, Stéphane Ballet

Publication date: 21 February 2012

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-011-0047-1

zbMATH Keywords

predictioncomplexitycryptographypseudo-randomnesspseudo-random number generatordistinguishableYao's theorem

Mathematics Subject Classification ID

Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Random number generation in numerical analysis (65C10)

Related Items (2)

A fast pseudorandom number generator with BLAKE hash function ⋮ Randomness in Cryptography

Cites Work

• Modern cryptography, probabilistic proofs and pseudo-randomness
• Foundations of Cryptography
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on Yao's theorem about pseudo-random generators