Can a one-way function f on n input bits be used with fewer than n bits while retaining
comparable hardness of inversion? We show that the answer to this fundamental question is …

In a seminal paper, Håstad, Impagliazzo, Levin, and Luby showed that pseudorandom
generators exist if and only if one-way functions exist. The construction they propose to …

We consider two of the most fundamental theorems in Cryptography. The first, due to Håstad
et al. HILL99, is that pseudorandom generators can be constructed from any one-way …

Two of the most useful cryptographic primitives that can be constructed from one-way
functions are pseudorandom generators (PRGs) and universal one-way hash functions …

In their seminal paper [HILL99], Håstad, Impagliazzo, Levin and Luby show that a
pseudorandom generator can be constructed from any one-way function. This plausibility …

We describe efficient constructions for various cryptographic primitives in private-key as well
as public-key cryptography. Our main results are two new constructions of pseudo-random …

We show that the existence of one-way functions is necessary and sufficient for the
existence of pseudo-random generators in the following sense. Let ƒ be an easily …

We consider the question of constructing pseudorandom generators that simultaneously
have linear circuit complexity (in the output length), exponential security (in the seed length) …

We consider two of the most fundamental theorems in cryptography. The first, due to Håstad
et al. SIAM J. Comput., 28 (1999), pp. 1364–1396 is that pseudorandom generators can be …

We continue the study of the efficiency of black-box reductions in cryptography. We focus on
the question of constructing strong one-way functions (respectively, permutations) from weak …