Next: Incremental Cryptography and Application
Up: The First 1.5 Years
Previous: On Yao's XOR-Lemma
It is shown how to construct length-preserving 1-1 one-way functions
(rather than (infinite) families of (finite) one-way permutations)
based on popular intractability assumptions (e.g., RSA, DLP).
Comments:
Authored by O. Goldreich, L.A. Levin and N. Nisan. Appeared in
ECCC, TR95-029, 1995.
Oded Goldreich
2003-07-30