Abstract
The Merkle-Hellman cryptosystem is one of the two major public-key cryptosystems proposed so far. It is shown that the basic variant of this cryptosystem, in which the elements of the public key are modular multiples of a superincreasing sequence, in breakable in polynomial time. © 1984 IEEE
Cite
CITATION STYLE
APA
Shamir, A. (1984). A Polynomial-Time Algorithm for Breaking the Basic Merkle—Hellman Cryptosystem. IEEE Transactions on Information Theory, 30(5), 699–704. https://doi.org/10.1109/TIT.1984.1056964
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free