HOME / PUBLICATIONS /

Efficiency improvements in constructing pseudorandom generators from one-way functions

Citation:

Haitner, Iftach, Omer Reingold, and Salil Vadhan. “Efficiency improvements in constructing pseudorandom generators from one-way functions.” SIAM Journal on Computing 42, no. 3 (2013): 1405-1430.
SIAM2013.pdf339 KB
STOC2010.pdf511 KB

Abstract:

Version History: Special Issue on STOC ‘10.

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 Håstad, 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 “in-accessible entropy” recently introduced in [Haitner, Reingold, Vadhan, and Wee, STOC ’09]. An additional advan- tage over previous constructions is that our pseudorandom generators are parallelizable and invoke the one-way function in a non-adaptive manner. Using [Applebaum, Ishai, and Kushilevitz, SICOMP ’06], this implies the existence of pseudorandom generators in NC\(^0\) based on the existence of one-way functions in NC\(^1\).

Publisher's Version

See also: Computational Complexity, Cryptography, Pseudorandomness, Pseudorandomness and Combinatorial Constructions (US-Israel Binational Science Foundation; BSF 2002246), The Assumptions for Cryptography (NSF CNS-0831289)
Last updated on 07/14/2020