18CS701: Cryptography & Network Security

Assignment II

1. Explain the following Block Cipher modes of operation:

(i) Cipher Block Chaining Mode
(ii) Cipher Feedback Mode
(iii) Counter Mode
2. Discuss Fermat’s theorem and Euler’s theorem.
3. Explain the Miller Rabin algorithm for testing primality.
4. Describe RSA algorithm with an example.
5. Explain Diffie Hellman key exchange algorithm.
6. List the applications of cryptographic hash functions.
7. Discuss the two simple hash functions used to provide message
authentication.
8. Describe SHA-512 algorithm with necessary diagrams.
9. Explain the uses of Message Authentication Code (MAC) with necessary
diagrams.
10. Define Euler’s totient function. Determine Ф(36), Ф( 165), Ф(21)
11. Find the secret key using Diffie Hellman algorithm, given

(i) q=19, XA=7, XB=8 and α=10

(ii) q=11, XA=8, XB=4 and α=2

12. Using Miller Rabin algorithm, test for Primality, given

(i) n=13, a=2
(ii) n=11, a=2
(iii) n=14, a=2
13. Perform encryption and decryption using RSA algorithm, given
(i) p=11, q=3, e=3, M=14
(ii) p=7, q=11, e=13, M=2