Problems of Information Transmission

, Volume 39, Issue 1, pp 92–103

The Tale of One-Way Functions

Authors

  • L. A. Levin
    • Boston University
Article

DOI: 10.1023/A:1023634616182

Cite this article as:
Levin, L.A. Problems of Information Transmission (2003) 39: 92. doi:10.1023/A:1023634616182

Abstract

The existence of one-way functions (owf) is arguably the most important problem in computer theory. The article discusses and refines a number of concepts relevant to this problem. For instance, it gives the first combinatorial complete owf, i.e., a function which is one-way if any function is. There are surprisingly many subtleties in basic definitions. Some of these subtleties are discussed or hinted at in the literature and some are overlooked. Here, a unified approach is attempted.

Copyright information

© MAIK “Nauka/Interperiodica” 2003