Suppose that plaintext message units are digraphs in the ordinary 26-letter alphabet, where (as usual) A-Z corresponds to 0-25. We represent each digraph ij as an integer in the following way:

(26 · i) + j:
For example, the digraph "IN" is represented as
26 · 8 + 13 = 221:
You receive the sequence of ciphertext message units,

5809; 7565; 7730; 3226; 10096; 6484; 8364; 9043; 9552; 5072
which were encrypted using a Merkle-Hellman knapsack system. (Each unit is the encryption of a digraph, and hence represents two plaintext letters.) The private key for the system is

Question

Suppose that plaintext message units are digraphs in the ordinary 26-letter alphabet, where (as usual) A-Z corresponds to 0-25. We represent each digraph ij as an integer in the following way:

(26 · i) + j:
For example, the digraph "IN" is represented as
26 · 8 + 13 = 221:
You receive the sequence of ciphertext message units,

5809; 7565; 7730; 3226; 10096; 6484; 8364; 9043; 9552; 5072
which were encrypted using a Merkle-Hellman knapsack system. (Each unit is the encryption of a digraph, and hence represents two plaintext letters.) The private key for the system is

anonymous · Answer

(M = 2617;W = 1036; {3; 5; 10; 19; 41; 79; 161; 320; 641; 1311}):