CHAPTER 11
THE KNAPSACK CRYPTOSYSTEM
THE MERKLE-HELLMAN knapsack system was the first example of a public key cryptographic system. Although the trap-door knapsack problem did not live up to its promises of being “computationally infeasible” to solve, it was a major cryptographic achievement. This chapter examines the contribution and the remarkably elegant cryptanalysis of the Merkle–Hellman system by Adi Shamir.
Get Computer Security and Cryptography now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
