On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem
In 1976 Diffie and Hellman introduced the concept of a public-key cryptosystem . In 1977 Rivest, Shamir, and Adleman discovered the first incarnation of such a system , and soon afterwards Merkle and Hellman produced a second one . Despite the widespread interest in the area, the years have produced no other public-key cryptosystems which have attracted widespread interest.
Unable to display preview. Download preview PDF.
- Diffie, W., and Hellman, M. E., “New directions in cryptography,” IEEE Trans. Information Theory, IT-22, Nov. 1976, pp. 644–654.Google Scholar
- 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
- 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
- Rivest, R., Shamir, A., and Adleman, L., “A method for obtaining digital signatures and public-key cryptosystems,” CACM 22–2, Feb. 1978.Google Scholar
- Shamir, A., “A polynomial time algorithm for breaking th basic Merkle-Hellman cryptosystem,” Proc. 23rd Annual Foundations of Computer Science, 1982.Google Scholar