A note on Yao's theorem about pseudo-random generators
From MaRDI portal
Publication:662183
DOI10.1007/s12095-011-0047-1zbMath1235.94045MaRDI 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
prediction; complexity; cryptography; pseudo-randomness; pseudo-random number generator; distinguishable; Yao's theorem
94A60: Cryptography
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
65C10: Random number generation in numerical analysis
Related Items
Cites Work