Next: Bounds on 2-Query Codeword
Up: Back at Weizmann (1998-2003)
Previous: Almost k-wise independence versus
The GGM construction is a natural way to obtain pseudorandom
function ensembles from arbitrary pseudoramdon generators.
This work shows that, in general, this construction does not
yield correlation intractable ensembles.
Specifically, it may happen that, given a description of such a function,
one can easily find an input that is mapped to zero under this function.
Comments:
Authored by O. Goldreich. Appeared in
Cryptology ePrint Archive, Report 2002/110, 2002.
ECCC, TR02-047, 2002.
Oded Goldreich
2003-07-30