Abstract
In 1976 Diffie and Hellman introduced the concept of a public-key cryptosystem [1]. In 1977 Rivest, Shamir, and Adleman discovered the first incarnation of such a system [4], and soon afterwards Merkle and Hellman produced a second one [3]. Despite the widespread interest in the area, the years have produced no other public-key cryptosystems which have attracted widespread interest.
Research sponsored by National Science Foundation, Grant #MCS-8022533
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diffie, W., and Hellman, M. E., “New directions in cryptography,” IEEE Trans. Information Theory, IT-22, Nov. 1976, pp. 644–654.
Lenstra, A. K., Lenstra, H. W., and Lovacz, L., “Factoring polynomials with rational coefficients,” Report 82–05, March 1982, Department of Math., Univ. of Amsterdam.
Merkle, R. C., and Hellman, M. E., “Hiding information and signatures in trapdoor knapsacks,” IEEE Trans. Information Theory, IT-24, Sept. 1978, pp. 525–530.
Rivest, R., Shamir, A., and Adleman, L., “A method for obtaining digital signatures and public-key cryptosystems,” CACM 22–2, Feb. 1978.
Shamir, A., “A polynomial time algorithm for breaking th basic Merkle-Hellman cryptosystem,” Proc. 23rd Annual Foundations of Computer Science, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this paper
Cite this paper
Adleman, L.M. (1983). On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0602-4_29
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0602-4_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-0604-8
Online ISBN: 978-1-4757-0602-4
eBook Packages: Springer Book Archive