Skip to main content
SpringerLink
Log in

On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem

  • Conference paper
Advances in Cryptology

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Diffie, W., and Hellman, M. E., “New directions in cryptography,” IEEE Trans. Information Theory, IT-22, Nov. 1976, pp. 644–654.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. Rivest, R., Shamir, A., and Adleman, L., “A method for obtaining digital signatures and public-key cryptosystems,” CACM 22–2, Feb. 1978.

    Google Scholar 

  5. Shamir, A., “A polynomial time algorithm for breaking th basic Merkle-Hellman cryptosystem,” Proc. 23rd Annual Foundations of Computer Science, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Southern California and Massachusetts Institute of Technology, USA

    Leonard M. Adleman

Authors
  1. Leonard M. Adleman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of California, Santa Barbara, California, USA

    David Chaum

  2. Massachusetts Institute of Technology, Cambridge, Massachusetts, USA

    Ronald L. Rivest  & Alan T. Sherman  & 

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation