Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR95-029 | 15th June 1995 00:00

On Constructing 1-1 One-Way Functions

RSS-Feed




TR95-029
Authors: Oded Goldreich, Leonid Levin, Noam Nisan
Publication: 15th June 1995 18:52
Downloads: 1109
Keywords: 


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.



ISSN 1433-8092 | Imprint