Knapsack Example:

Public Key (General Knapsack): 82, 123, 287, 83, 248, 373, 10, 471

Alice's Cipher: 10010110 or 82+83+373+10 = 548

Private Key (Superincreasing Knapsack): 2, 3, 7, 14, 30, 57, 120, 251 and Bob has 41^-1mod491 --> 12 to decrypt the message.

24. For the knapsack example given in the text, the ciphertext was not reduced modulo n.

24. a. Show that for the specific example given in this chapter, the knapsack also works if the ciphertext is reduced modulo n.

24. b. Show that this is always the case, that is, show that it makes no difference to the recipient whether the ciphertext was reduced modulo n or not.

24. c. Is either case (reducing the ciphertext modulo n or not) preferable from Trudys perspective?