Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Merkle-Hellman Knapsack Cryptosystem

Cryptographic Algorithm

The Merkle-Hellman knapsack cryptosystem was one of the earliest public key cryptosystems, published by Ralph Merkle and Martin Hellman in 1978. Adi Shamir published a polynomial-time attack against it in 1984, and the cryptosystem is now considered insecure.

Facts
Time Complexity
Time Complexity (category)
Polynomial Time -- O(n^k) 1
Connections

Credited To

Source Merkle-Hellman knapsack cryptosystem (Wikipedia)
Ralph Merkle, Pioneers
Source Merkle-Hellman knapsack cryptosystem (Wikipedia)

In Field

Cryptography, Fields
Source Merkle-Hellman knapsack cryptosystem (Wikipedia)

Invented By

Martin Hellman co-invented this early public-key cryptosystem with Ralph Merkle, published in 1978.

Source Wikipedia: Martin Hellman
Ralph Merkle, Pioneers

Ralph Merkle co-invented this early public-key cryptosystem with Martin Hellman, published in 1978.

Sources
1. Merkle-Hellman Knapsack Cryptosystem (Wikipedia)
Wikipedia infobox: time complexity polynomial
Quote, Wikipedia infobox: time complexity polynomial
polynomial
View the Source
Merkle-Hellman knapsack cryptosystem (Wikipedia)
  • In Field: Cryptography, Lead paragraph
  • In Group: Public-Key Encryption Scheme, Lead section
    one of the earliest public key cryptosystems
  • Credited To: Ralph Merkle, Lead paragraph
    It was published by Ralph Merkle and Martin Hellman in 1978.
  • Credited To: Martin Hellman, Lead paragraph
    It was published by Ralph Merkle and Martin Hellman in 1978.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.