Abstract
A new approach to one-way functions is considered. A one-way function is defined to be a function which is easy to compute but hard to invert in the sense that its inverse is not inDTIME(n k) for fixed largek. While this is weaker than the usual definition of one-way functions it requires no complexity-theoretic assumptions. Some of these functions are proved to exist, while the existence of other, stronger functions is shown to bear upon open problems in complexity theory. An application to public-key cryptosystems is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Even and Y. Yacobi, An observation concerning the complexity of problems with few solutions and its applications to cryptography. Technical Report No. 197, The Technion, Computer Science Department, Technion, Haifa, 1980.
S. Fven, A. L. Selman, and Y. Yacobi, The complexity of promise problems with applications to public-key cryptography,Inform. and Control,61(2) (1984), 159–173.
J. Grollmann and A. Selman, Complexity measures for public-key cryptosystems,SIAM J. Comput.,17 (1988), 309–335.
Author information
Authors and Affiliations
Additional information
This work was supported in part by NSA Grant MDA904-87-H-2003 and by NSF Grant MIP-8608137.
Rights and permissions
About this article
Cite this article
Homer, S., Wang, J. Absolute results concerning one-way functions and their applications. Math. Systems Theory 22, 21–35 (1989). https://doi.org/10.1007/BF02088290
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02088290