Electronic Resource
Springer
Theory of computing systems
22 (1989), S. 21-35
ISSN:
1433-0490
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02088290
Permalink
|
Location |
Call Number |
Expected |
Availability |