Semester :VII Max.mark:100 Sub.code &Title: EC2035 cryptography and network security INTERNAL TEST-1 PART -A (5*2=10) (Answer all the question) 1. List the importance features of Kerberos Version 5. [nov/dec 2014] 2. What are the important services offered by PGP? [nov/dec 2013] 3. Why does an ESP include the padding field? [nov/dec 2013] 4. Write down the steps involved in SSL required protocol. 5. Draw an X.509 message format. 6. Give the authentication requirements. [nov/dec 2013] 7. Distinguish between entity and message authentication. [nov/dec 2013] 8. Using Fermats theorem, find 3201mod 11. [nov/dec 2014] 9. Define trap door one way function. [nov/dec 2014] 10. Define Eulers totient function (used in RSA algorithm) PART- B (5*16=80 marks) (Answer all the question) 11. (a) Explain in detail Encryption and decryption process of DES algorithm. [nov/dec 2014] (16) (or) 12. (b) Explain in detail about AES algorithm with key generation algorithm and its expansion methods. [nov/dec 2013] (16) 13. (a) Explain in detail about types of block cipher designs. [nov/dec 2013] (16) (or) 14. (b) Explain about substitution and transposition techniques with two examples for each. (16) 15. (a) (i) What is the need for triple DES? Write the disadvantages of double DES and explain triple DES. (8)
(ii) With a neat block diagram, explain network security model
and important parameters associated with it. [nov/dec 2013] (8) (or) 16. (b) (i) Explain the purpose of CRT (8) (ii) How to check the primality? (8) 17. (a) (i) With the steps involved, explain Diffie Hellman key exchange algorithm in detail. [nov/dec 2013] (8) (ii) User A and B use the Diffie Hellman key exchange technique with a common prime q=71 and primitive root =7. If user A has private key XA=5 what is As public key YA? [nov/dec 2013] (8) (or) 18. (b) (i) Explain RSA algorithm for encryption and decryption of data. [nov/dec 2013] (8) (ii) Perform encryption and decryption using RSA algorithm for p=3,q=11,e=7 and for message M=5. [nov/dec 2013] (8) 19. (a) (i) Explain the different ways of key distribution in Asymmetric key cryptography. [nov/dec 2014] (8) (ii) Perform encryption and decryption using the RSA algorithm for following: [nov/dec 2014] (8) (1). p=7; q=13; e=7; M=11. (2). p=19; q=23; e=3; M=11. (or) 20. (b) (i) How do Elliptic curve take part in encryption and decryption process? [nov/dec 2014] (8) (ii) User A and B use the Diffie Hellman key exchange technique with a common prime q=71 and primitive root =7. If user A has private key XA=3, what is As public key YA? If user B has private key XB=10, what is Bs public key YB? What is the shared secret key? [nov/dec 2014] (8)