Final Exam Math 10: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 0 April 2002 :0 11:00 a.m. Instructions: Please be as neat as possible (use a pencil), and show your work. A correct answer with no work shown may not receive full credit. Start each numbered question on a new page. Unless otherwise indicated, use your calculator only to do basic arithmetic and function evaluation. Turn in your test sheets along with those containing your work. 1. (1 points) For each of the following indicate whether the statement is true or false. (a) If the greatest common divisor of integers a and b is 1, then either a or b is prime. (b) A scytale is a device that implements a type of polyalphabetic substitution. (c) A principle of cryptography is that the security of a ciphersystem resides in the key information. (d) In a substitution cipher, the letters in the plaintext message are rearranged. (e) If Alice and Bob have exchanged a great deal of Vigenère key data and they use this method, alway using a key as long as the plaintext and never re-using a key, then Eve, attempting a ciphertext-only attack and knowing that the underlying plaintext is English, will do no better than guessing at the plaintext. (f) If an English plaintext is enciphered using the Vigenère method with a long random keyword, then the index of coincidence of the resulting ciphertext will be close to 1/2. (g) A -bit linear shift register generates a sequence of 0 s and 1 s that never repeats. (h) In any sample of ordinary English text, the letter E will be the most frequent.
(i) If an efficient method for factoring very large numbers is found, then RSA would no longer be a secure means of encryption. (j) The number with base twenty-six representation EXAM is. (k) A principle of cryptography is that the security of a cipher system rests on keeping the method of encipherment secret. (l) 09 20 (mod 09). (m) RSA has been proven unbreakable. (n) Public key cryptosystems tend to run on computers more slowly than secret-key systems. 2. ( points ) Decipher NOCJUT, which was enciphered with the affine encipherment function E(x) =(21x + 1)mod 2.. ( points) Decipher [ FCUWP, ] which was enciphered using the Hill cipher 11 1 matrix A =. 12 1. ( points ) Decipher TETST WTUEA HTEOU RTRRA OBTON U, which was enciphered with a keyword columnar transposition using the keyword URGENT.. ( points) Decipher FONIIOSJRJ which was enciphered using the Vigenère method with keyword NUMBER.. ( points) Decipher 00101101, which was enciphered using the binary Vigenère method with the key stream generated by the FSR b b + b 1 mod 2 with initial bit values b b b b 2 b 1 = 10001.. (9 points ) (a) Find the greatest common divisor of 91 and 2. (b) The number 109 is a product of two distinct primes. At most how many trial divisions by primes will be required to find these primes (see the prime table)? (c) Use the corollary to Fermat s little theorem to help to compute 1 mod 9.. (10 points) Suppose that Alicia is implementing RSA with primes p =, q = 1, and public exponent e = 1.
(a) Explain what she does to set up for receiving encrypted messages and calculate all of the numbers that she will use with these choices of p, q, and e. (b) If Roberto wants to send Alicia the message x = 2encrypted using her public key, determine the ciphertext he produces. (c) Suppose Alicia receives the encrypted message y =. Write down the expression she will need to evaluate in order to decrypt. (Do not actually evaluate this expression.) 9. (9 points) Explain briefly but completely what is involved in a cryptanalysis of the Vigenere cipher. Mention the various techniques we have used. 10. (9 points) Shown here are letter distributions for three different ciphertexts, one from a monoalphabetic substitution, one from a polyalphabetic substitution, and one from a transposition. (i) (ii) (iii) A B C 9 D E F G H I J 1 A B C D E F G H I J 22 12 1 1 10 1 29 1 A B C D E F G H I J 0 1 1 0 1 1 10 1 M N 0 O 1 P Q R S T U V W X M N O P Q R S T U V W X 1 2 21 1 1 1 2 0 0 M N O P Q R S T U V W X 2 0 1 0 1 1 1 1 0 9 0 (a) Indicate which distribution corresponds to which cipher. Explain. (b) For the polyalphabetic one, compute the index of coincidence. (c) Assuming encipherment by the Vigenère method with a keyword, use the Friedman test to estimate the keyword length. 11. (9 points) Alice and Bob are going to use the Diffie-Hellman key agreement protocol. If the public prime modulus is p = and the public base is s =,Alice generates the number a = 10, and Bob generates b = 1. Determine the key on which they agree. x 1 9 11 1 1 19 21 2 2 x 1 (mod 2) 1 9 21 1 19 2 11 1 2
A B C D E F G H I J M N O P Q R S T U V W X A B C D E F G H I J M N O P Q R S T U V W X A B C D E F G H I J M N O P Q R S T U V W X B C D E F G H I J M N O P Q R S T U V W X A C D E F G H I J M N O P Q R S T U V W X A B D E F G H I J M N O P Q R S T U V W X A B C E F G H I J M N O P Q R S T U V W X A B C D F G H I J M N O P Q R S T U V W X A B C D E G H I J M N O P Q R S T U V W X A B C D E F H I J M N O P Q R S T U V W X A B C D E F G I J M N O P Q R S T U V W X A B C D E F G H J M N O P Q R S T U V W X A B C D E F G H I M N O P Q R S T U V W X A B C D E F G H I J M N O P Q R S T U V W X A B C D E F G H I J M N O P Q R S T U V W X A B C D E F G H I J N O P Q R S T U V W X A B C D E F G H I J M O P Q R S T U V W X A B C D E F G H I J M N P Q R S T U V W X A B C D E F G H I J M N O Q R S T U V W X A B C D E F G H I J M N O P R S T U V W X A B C D E F G H I J M N O P Q S T U V W X A B C D E F G H I J M N O P Q R T U V W X A B C D E F G H I J M N O P Q R S U V W X A B C D E F G H I J M N O P Q R S T V W X A B C D E F G H I J M N O P Q R S T U W X A B C D E F G H I J M N O P Q R S T U V X A B C D E F G H I J M N O P Q R S T U V W A B C D E F G H I J M N O P Q R S T U V W X A B C D E F G H I J M N O P Q R S T U V W X
Primes 2 19 19 1 9 1229 12 12 211 2 29 11 21 9 121 11 11 21 21 2 191 1 9 12 1 1 211 2 2 19 91 129 19 11 21 29 2 11 19 9 91 9 129 1 1 21 2 29 1 199 01 9 12 19 11 211 2 291 1 211 9 09 991 129 1 1 219 2 29 19 22 19 99 12 11 1 220 20 201 2 22 1 2 1009 129 19 19 220 221 20 29 229 101 1291 1 19 221 21 219 1 2 9 1019 129 19 1901 2221 29 2 29 9 1021 101 101 190 22 2 2 1 21 1 101 10 10 191 229 29 2 21 91 10 10 109 191 22 21 21 2 99 1 109 119 11 19 221 2 2 2 0 9 109 121 119 199 22 29 21 9 29 09 101 12 121 191 229 291 29 1 21 21 101 11 12 19 22 29 2 2 2 9 10 1 1 199 221 209 29 1 21 1 09 109 1 1 19 22 21 290 2 11 10 11 1 199 229 221 2909 9 29 21 1091 199 1 199 229 2 291 0 2 109 109 19 1999 209 2 292 9 11 9 2 109 12 19 200 211 2 299 9 1 1 29 110 12 19 2011 2 29 29 101 1 9 1109 129 199 201 29 2 29 10 1 111 1 109 202 21 21 29 10 9 112 19 121 2029 2 2 299 109 99 9 1129 1 12 209 21 2 291 11 9 01 111 11 1 20 2 2 2999 12 0 11 1 11 20 21 29 001 11 9 1 1 11 19 1 209 2 29 011 1 1 111 11 1 201 21 299 019 19 19 111 11 19 20 2 20 02 19 9 1 90 11 1 1 20 29 211 0