Advanced Data Structures and Algorithms

Exercise Sheet 6
Hilary 2014
1. Using Extended-Euclid and the Chinese Remainder Theorem, nd all integers x that leave
remainders 3, 2, 1 when divided by 7, 5, 3 respectively.
2. Show that (nm) = (n)(m) for n and m coprime.
[Hint: Use the Chinese Remainder Theorem.]
3. Consider an RSA key set with p = 11, q = 29, n = 319, and e = 3. What value of d should
be used in the secret key? What is the encryption of the message M = 100?
4. Describe the computation of the Miller-Rabin primality test on input 561 if the random value
a Z
561
that is chosen is x = 20.
5. (Optional) Let n = p
1
p
2
p
t
, where p
1
, p
2
, . . . , p
t
are distinct odd primes. Using the Chinese
Remainder Theorem, show that n is a Carmichael number i (p
i
1) | (n1) for i = 1, 2, . . . , t.
1