B.1) In a k shift algorithm, the letters are substituted with another letter that is k letters after (right shift wrap-around). For instance, letter A with 2 shift becomes C and letter Z becomes B. A student proposes a TripleShift encryption algorithm with 3 keys: first shift the plaintext using the first key, then shift the result using the second key, then shift the result with the third key. Each key is a number from 1 to 25. (a) Apply TripleShift to the plaintext = CAT using these 3 keys: 2 5 7

B.2) A Brute Force method to break TripleShift is to try all possible keys. Explain how many possible key combinations there are.

B.3) Explain if TripleShift is harder than the Shift method, or easier, or the same.