The Tale of Oneway Functions
Abstract
The existence of oneway functions 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 oneway 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.
 Publication:

arXiv eprints
 Pub Date:
 December 2000
 arXiv:
 arXiv:cs/0012023
 Bibcode:
 2000cs.......12023L
 Keywords:

 Computer Science  Cryptography and Security;
 Computer Science  Computational Complexity;
 Computer Science  General Literature;
 F.1;
 F.0;
 G.3
 EPrint:
 Small changes. 16 pages in English