DocumentCode
939403
Title
A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
Author
Shamir, Adi
Volume
30
Issue
5
fYear
1984
fDate
9/1/1984 12:00:00 AM
Firstpage
699
Lastpage
704
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1984.1056964
Filename
1056964
Link To Document