A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the complexity of analysis of automata over a finite ring
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
The paper shows that an "informal" interpretation of one-way functions in modern cryptography is inadequate and defines such functions in terms of information theory. This combination of complexity and information theories opens new opportunities for constructing one-way functions, whose one-way transformation is based on the ambiguity of their inverse mappings. It is shown that random mappings are promising candidates for constructing such functions.