Welcome to the resource topic for 2009/548
Title:
A NOTE ON YAO’S THEOREM ABOUT PSEUDORANDOM GENERATORS
Authors: Stéphane BALLET, Robert ROLLAND
Abstract:The Yao’s theorem gives an equivalence between the indistinguishability of a pseudorandom generator and the impredictability of the next bit from an asymptotic point of view. We present in this paper, with detailed proofs, some modified versions of the Yao’s theorem which can be of interest for the study of practical systems. We study the case of one pseudorandom generator, then the case of a family of pseudorandom generators having the same fixed length and last an asymptotical version of the previous result. We compute in each case the cost of the reduction between the two algorithms.
ePrint: https://eprint.iacr.org/2009/548
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .