TR1333

TUTORIAL 4

1 Find the greatest common divisor of:

a) 60, 90
b) 0, 17
c) 110, 273
d) 20, 40
e) 13, 132

2 Use the Euclidean algorithm to find the greatest common divisor of each pair of integers
below:
a) 331, 993
b) 67942, 4209
c) 2091, 4807
d) 490256, 337
e) 315, 825
f) 1529, 14039
g) 1111, 11111

3 Use Exponentiation By Repeated Squaring for the given values of a, n and z.

a) a = 5, n =10, z = 21
b) a = 143, n =10, z = 230.

4 What does the following message say using given Caeser cephir?

JRQH WR ZDWFK KDUOHTXLQV. EDFN DW VHYHQ

5 Assume that we choose primes p = 59, q = 101, n = 41

a) Compute z.
b) Compute Φ.
c) Compute s
d) Encrypt 584 using public key z, n.
e)  Decrypt 250.

6 Alice wants to send message HELLO using the RSA system with p = 7 and q = 11 and n
= 53 by translating each letter into integers, so that Bob knows it is from Alice. What is
the encrypted message of Alice?

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5
7 Encrypt the message STOP using the RSA system with p = 43 and q = 59 and n = 13,
translating each letter into integers and grouping together pairs of integers.

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5

8 What is the original message encrypted using the RSA system with p = 43 and q = 59
and n = 13, if the encrypted message is 0981 0461?

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5

9 Encrypt the message MATH using the RSA system with prime numbers p = 43 and q =
59 and n = 5.

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5