Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Foundations of Cryptography: Volume 1
Foundations of Cryptography: Volume 1
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Yao's theorem gives an equivalence between the indistinguishability of a pseudo-random generator and the unpredictability of the next bit from an asymptotic point of view. In this paper we present with detailed proofs, modified versions of Yao's theorem which can be of interest for the study of practical cryptographic primitives. In particular we consider non-asymptotic versions. We study the case of one pseudo-random generator, then the case of a family of pseudo-random generators with the same fixed length and finally we consider the asymptotic case. We compute in each case the cost of the reduction (in the sense of complexity theory) between the two algorithms.