Knapsack Exam

• Problem 1 (45 points)
  • Create a supreincreasing sequence of 8 elements of your choice
  • Complete the private key: calculate E, choose appopriate M and W.
  • Create Public Key
  • Encrypt the following text: YES

• Problem 2 (45 points): Decrypt the ciphertext from Problem 1. Explain all steps including the use of polynomial time algorithm.

• Problem 3 (10 points): Suppose your public key sequence is B={10, 3, 8, 2, 1} and your ciphertext is 6. Use Dynamic Programming algorithms to construct the matrix and find the plaintext binary sequence.