On constructing 1-1 one-way functions

Oded Goldreich*, Leonid A. Levin, Noam Nisan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

7 Scopus citations


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.

Original languageAmerican English
Title of host publicationStudies in Complexity and Cryptography
Subtitle of host publicationMiscellanea on the Interplay between Randomness and Computation
EditorsOded Goldreich
Number of pages13
StatePublished - 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6650 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


  • Discrete Logarithm Problem
  • One-Way Functions
  • RSA


Dive into the research topics of 'On constructing 1-1 one-way functions'. Together they form a unique fingerprint.

Cite this