Cryptography- 21EC642

Assignment-1
1. Use Extended Euclid’s algorithm to find inverse of 12 modulo 79.
2. Explain Euclid’s algorithm to find GCD of 2 integers.
3. Explain the following
a. Groups.
b. Rings.
c. Fields.
4. Explain Mono-alphabetic & Poly-alphabetic Cipher with example.
5. Difference between:
a. Public key & Private key
b. Block cipher & Stream Cipher
c. Substitution & Transposition Cipher
6. For each of the following equations, find an integer x that satisfies the equation.
a. 5x = 4 (mod 3).
b. 7x = 6 (mod 5).
c. 9x = 8 (mod 7).
7. Prove the following:

a. [(a mod n) - (b mod n)] mod n = (a - b) mod n

b. [(a mod n) * (b mod n)] mod n = (a * b) mod n

8. What are the two basic functions used in encryption algorithms? How many keys are required
for two people to communicate via a cipher?
9. Briefly define the Playfair cipher.
10. What is a transposition cipher?