Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls
Cryptography and Security
2012-05-22 v1 Computational Complexity
Abstract
We show that a black-box construction of a pseudorandom generator from a one-way function needs to make Omega(n/log(n)) calls to the underlying one-way function. The bound even holds if the one-way function is guaranteed to be regular. In this case it matches the best known construction due to Goldreich, Krawczyk, and Luby (SIAM J. Comp. 22, 1993), which uses O(n/log(n)) calls.
Keywords
Cite
@article{arxiv.1205.4576,
title = {Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls},
author = {Thomas Holenstein and Makrand Sinha},
journal= {arXiv preprint arXiv:1205.4576},
year = {2012}
}