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, is breakable in polynomial time.
No takes yet. Share an insight, caveat, or question.
Adi Shamir (1984) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: