Title :
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
Author :
Shamir, Adi ; Shamir, Adi ; Shamir, Adi ; Shamir, Adi
Abstract :
The cryptographic security of the Merkle-Hellman cryptosystem has been a major open problem since 1976. In this paper we show 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 :
Communication channels; Greedy algorithms; H infinity control; Mathematics; Performance analysis; Polynomials; Protection; Public key; Public key cryptography; Security;
Conference_Titel :
Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on
Conference_Location :
Chicago, IL, USA
DOI :
10.1109/SFCS.1982.5
