RSA Extra Problem MATH 312 - AMS 351 Spring 2015 1 Your mission is to decrypt the following top secret message. {2151}, {8530}, {7042}, {1564}, {8301}, {9654}, {1680}, {1876}, {2340}, {6127}, {8513}, {1924}, {5933}, {2208}, {1677}, {2190}, {0303}, {2403} The base1 of the code is 11021 and the exponent is 4325. The alphabet is listed below. Good luck. A 1 34 67 B 2 35 68 C 3 36 69 D 4 37 70 5 38 71 E F 6 39 72 G 7 40 73 H 8 41 74 I 9 42 75 J 10 43 76 K 11 44 77 L 12 45 78 M 13 46 79 N 14 47 80 O 15 48 81 P 16 49 82 Q 17 50 83 R 18 51 84 S 19 52 85 T 20 53 86 U 21 54 87 V 22 55 88 W 23 56 89 X 24 57 90 Y 25 58 91 Z 26 59 92 space 27 60 93 . 28 61 94 , 29 62 95 ? 30 63 96 ! 31 64 97 & 32 65 98 ; 33 66 99 Use the above space to outline your work and record the result. However, you should use a computer to do any big calculations.2 1 You will notice that my blocks are larger than my prime factors, but as the book points out, this is only a problem if the blocks are not relatively prime to the base. Each of my blocks are, so this does not create a problem. See 9 p.75 for more discussion of this. 2 As I explained in class possibilities include mathematica or excel or open oce. Note however that using open oce, I had to reduce after each exponentiation get the correct