Efficiency improvements in constructing pseudorandom generators from one-way functions

Iftach Haitner, Omer Reingold, and Salil P. Vadhan

Abstract

We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of Hastad, Impagliazzo, Levin and Luby [SICOMP '99]. The key to our construction is a new notion of next-block pseudoentropy, which is inspired by the notion of "inaccessible entropy" recently introduced in [Haitner et al., STOC '09]. An additional advantage over previous constructions is that our pseudorandom generators are parallelizable and invoke the one-way function in a non-adaptive manner. Using [Applebaum, Ishai, Kushilevitz, SICOMP '06], this implies the existence of pseudorandom generators in NC0 based on the existence of one-way functions in NC1.

Details

Publication typeInproceedings
Published inProceedings of the 42nd ACM Symposium on Theory of Computing, (STOC 2010)
Pages437-446
> Publications > Efficiency improvements in constructing pseudorandom generators from one-way functions