(5 points) 3. The Georgian alphabet has 33 letters and we can represent them with the integer values 0 to 32. If we are going to encrypt a Georgian plaintext using the affine cipher, how many possible keys are there, that is, what is the size of the key space?

(5 points) 4. If an alphabet has 31 letters, what is the size of the key space using the affine cipher?

(5 points) 5. Solve Computer Problem 1 on p. 59. I recommend writing a program but that's not necessary.

(10 points) 6. Solve Computer Problem 6 on p. 60. You may write a program for part (a) but you must write a program for part (b). The program may be in the "usual" languages, that is, C++, Java, or Python. Other languages may be used with permission.

The next two problems are based on this Vigenre ciphertext.

QHDLXNQLYNGAIGWBCERJFEARNIBKXUSVGZXKYNPXXTKGAATZRQCRFYIDCCLYXHUQXEIXFAFGEAMMAL YRGAYXQMTGACDJSYRTLEXUVRVIYFFEGXFKOYSPHGBBYTRESOXUNTXXAKLUAWYDINAAWCZWIFVMCROI UCEIFJYDJAYZJBEOTMUSGAGAYYQNIPTFPYMCBOYDYYSVGWDOJTBZLMFBYJXLQCUDRRIGMIUYWMQUUF RPCZQHTVJOUJSMNRVQQZEJYLACNHRFCPTFENZYEJCLYMBQUCGUMYQDBUAWLQTMOAXCZJBEABHQJYEA MQQDNIRLNTUINRMCYUJAQTZQMGOEXUDEONQPIDBXWNKNIEUNQMBQDUFGXLFXYBVKNTEZCBFJGJUTVH HMBWOZIFQNCTLMBQELYVGNTUHIAXNQUHSROYZJCEFUIACVOBFVAEGBBHGNEIMOHIYRIOZQ 

Program in Java

(10 points) 7. Write a program based on the following pseudocode to determine the likely length of the key used to create the above ciphertext. This is the technique described in section 2.3.1.

for shift = 1 to 14 do coincidenceCount = 0 for index = 0 to ciphertext length - 1 do shiftedIndex = (index + shift) % ciphertext length if ciphertext[index] == ciphertext[shiftedIndex] then coincidenceCount++; print shift, coincidenceCount 

(5 points) 8. Please break the above ciphertext using an online resource to help. There are some sites that, given the ciphertext, determine the key word and provide the plaintext. Format the plaintext by adding word spaces and punctuation.