Unformatted text preview: 3. Is the algorithm you described in part 1 the fastest? If not, what is the BigO of the fastest algorithm? Modular Exponentiation Prove ± ²³´µ²¶ · ¸ ²³´µ²¶¹ ± ²³´µ²¶ Modular Inverse Find the modulo inverse of 103 in base 4 (Hint: 103 is in base 4) Key Generation Given two prime numbers, 61 and 53 1. Find public key 2. Let e = 17, encrypt a message m, m = 3 Test for Prime Number Use Fermat’s little theorem to test if 23 is a prime number (Hint: avoid rounding)...
View
Full Document
 Spring '12
 Frances
 Array, Prime number, Modular Exponentiation Prove, Key Generation Given

Click to edit the document details