In addition, we present a general technique that can be used to speed up pseudorandom generators based on iterating one-way permutations. We construct our generator by applying this technique to results of [HSS93]. We also show how the generator given by Gennaro [Gen00] can be simply derived from results of Patel and Sundaram [PS98] using our technique.
Category / Keywords: foundations / pseudorandomness, pseudorandom generator, hardcore bits Publication Info: Third Conference on Seciruty in Communication Networks (SCN '02) Date: received 27 Aug 2002, last revised 28 Aug 2002 Contact author: reyzin at bu edu Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20020828:202215 (All versions of this report) Short URL: ia.cr/2002/131