On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem-Reference-Cited by-同舟云学术

On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem

Published:1983 Issue: Volume: Page:303-308
ISSN:
Container-title:Advances in Cryptology
language:
Short-container-title:

Author:

Adleman Leonard M.

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4757-0602-4_29

Reference5 articles.

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

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.

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.

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

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

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Knapsack Cryptographic Schemes;Encyclopedia of Cryptography, Security and Privacy;2024

2. Knapsack Cryptographic Schemes;Encyclopedia of Cryptography and Security;2011

3. A knapsack public-key cryptosystem with cyclic code over $GF(2)$;JSIAM Letters;2010

4. Public key cryptography;Computer Security and Industrial Cryptography;1993

5. Cryptanalysis of another knapsack cryptosystem;Advances in Cryptology — ASIACRYPT '91;1993