 |
 |
|
This article is cited in 4 papers
One-Way Functions L. A. Levin 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. UDC: 621.391:519.2 Citation: L. A. Levin, “One-Way Functions”, Probl. Peredachi Inf., 39:1 (2003), Citation in format AMSBIB:
Linking options:  Full text (in Russian): PDF file (2362 kB)
References (in Russian):
PDF file
HTML файл
English version: Problems of Information Transmission, 2003, 39:1,  Review databases:   Citing articles on Google Scholar: Russian citations, English citations Related articles on Google Scholar: Russian articles, English articles This publication is cited in the following artiles:
|
|
||||||||||||||||||||||||||||||||||||||||
|
|
Contact us: |
 Terms of Use
|
Registration |
|