Title :
A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
fDate :
9/1/1984 12:00:00 AM
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, is breakable in polynomial time.
Keywords :
Cryptography; Computer science; Graphics; Mathematics; Microcomputers; Polynomials; Protection; Public key; Public key cryptography; Security; Testing;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1984.1056964
