On Constructing 1-1 One-Way Functions
Oded Goldreich, Leonid Levin and Noam Nisan
Abstract: We show how to construct length-preserving 1-1 one-way functions based on popular intractability assumptions (e.g., RSA, DLP). Such 1-1 functions should not be confused with (infinite) families of (finite) one-way permutations. What we want and obtain is a single (infinite) 1-1 one-way function.
Keywords: One-Way Functions, RSA, Computational Number Theory, Cryptography.
comment: received May 12th, 1996. Written mainly in Dec. 1994. Appears as report 95-029 of ECCC.
contact author: oded@wisdom.weizmann.ac.il
Fetch PostScript file of the full paper.