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 …

A pseudorandom generator is an easy-to-compute function that stretches a short random
string into a much longer string that" looks" just like a random string to any efficient …

Abstract In 1984, Goldreich, Goldwasser and Micali formalized the concept of
pseudorandom functions and proposed a construction based on any length-doubling …

Pseudorandom function families are a powerful cryptographic primitive, yielding, in
particular simple solutions for the main problems in private key cryptography. Their …

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 …

Much research in theoretical cryptography has been centered around finding the weakest
possible cryptographic assumptions required to implement major primitives. Ever since Diffie …

Why fragments? Several years ago, Sha Goldwasser and myself have decided to write
together a book titled\Foundations of Cryptography". In a rst burst of energy, I've written most …

A central tool in constructing pseudorandom generators, secure encryption functions, and in
other areas are “hard-core” predicates b of functions (permutations) ƒ, discovered in [Blum …

We show very efficient constructions for a pseudorandom generator and for a universal one-
way hash function based on the intractability of the subset-sum problem for certain …

Randomizing polynomials allow representing a function f (x) by a low-degree randomized
mapping ̂ f (x, r) whose output distribution on an input x is a randomized encoding of f (x). It …