Abstract
Merkle(1) has shown how keys can be exchanged over a public channel by the use of puzzles. His method gives a work advantage ofO(N 2)/O(N). He also posed the problem of finding other methods of using puzzles that give better work advantage. This paper provides a solution to Merkle's problem. A new method of key exchange, called the nested puzzles method, is also introduced.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. C. Merkle, Secure communications over insecure channels,Comm. of the ACM 21:294–299 (April 1978).
W. Diffie and M. E. Hellman, New directions in cryptography,IEEE Trans on Information Theory IT-22:644–659 (November 1976).
A. Shamir, R. L. Rivest, and L. M. Adleman, Mental poker, MIT Lab. of Computer Science Report TM-125, pp. 1–7 (November 1978).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kak, S.C. On the method of puzzles for key distribution. International Journal of Computer and Information Sciences 13, 103–109 (1984). https://doi.org/10.1007/BF00978711
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00978711