Next: On the Security of
Up: Back at Weizmann (1998-2003)
Previous: Session-Key Generation using Human
This work suggests a candidate one-way function using combinatorial
constructs such as expander graphs. These graphs are used to
determine a sequence of small overlapping subsets of input bits,
to which a hard-wired random predicate is applied.
The conjectured difficulty of inverting the suggested function
does not seem to follow from any well-known assumption,
but is rather proposed as an open problem.
Comments:
Authored by O. Goldreich. Appeared in
Cryptology ePrint Archive, Report 2000/063, 2000.
ECCC, TR00-090, 2000.
Oded Goldreich
2003-07-30