06.01.2015 Views

Cryptology - Unofficial St. Mary's College of California Web Site

Cryptology - Unofficial St. Mary's College of California Web Site

Cryptology - Unofficial St. Mary's College of California Web Site

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

228 CHAPTER 11. KNAPSACK CIPHERS<br />

11.6 Summary<br />

In the past 25 years it has become fashionable to take “intractable” mathematical<br />

problems and try to turn them into cryptosystems. One <strong>of</strong> the first examples<br />

<strong>of</strong> a problem put to such use was the Knapsack Problem. In its full generality<br />

(from a large set <strong>of</strong> items choose some subset that maximizes value while<br />

keeping the total weight under some given bound) the Knapsack Problem, also<br />

known as the Subset Sum Problem, is known to be such an intractable problem.<br />

In 1977 Merkle and Hellman announced a cipher system based on a version<br />

<strong>of</strong> the Knapsack problem. It had the advantage <strong>of</strong> being a public key system,<br />

plus was relatively fast. This system starts with a set <strong>of</strong> super-increasing weights<br />

(each successive weight is larger than the sum <strong>of</strong> all the previously chosen ones).<br />

After a modular multiplication (and a permutation <strong>of</strong> their order) the weights<br />

are made public. To send a binary message send the sum <strong>of</strong> the weights corresponding<br />

to the 1’s in the message. The creator <strong>of</strong> the system can undo the<br />

modular multiplication, and so to read the message needs only to solve the<br />

sum-subset problem for a super-increasing set, which is easy.<br />

It was quickly suspected that hiding the super-increasing nature <strong>of</strong> the<br />

weights by a modular multiplication and permutation was not really sufficient,<br />

and this proved to be the case. By 1984 most forms <strong>of</strong> the Knapsack Ciphers<br />

had been shown to be insecure. Nonetheless, they provide a lovely case study<br />

<strong>of</strong> a modern cryptosystem.<br />

11.7 Topics and Techniques<br />

1. What is the general Knapsack Problem What is the meaning <strong>of</strong> “knapsack”<br />

in the name<br />

2. What is super-increasing<br />

3. Why is a Knapsack Problem with super-increasing weights easy to solve<br />

How to solve it<br />

4. How can a set <strong>of</strong> super-increasing weights be modified into a set <strong>of</strong> not<br />

super-increasing weights<br />

5. Explain the setup <strong>of</strong> a Knapsack Cipher.<br />

6. How does a Knapsack Cipher encipher What steps are involved<br />

11.8 Exercises<br />

1. Given the weights 41, 28, 39, 57, 49 and 31, and being allowed to use them<br />

possibly multiple times, can the weight 782 be achieved, and how

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!