‘Time 10. ul. Reg. No.: I Question Paper Code : 96414 ‘M.Sc. DEGREE EXAMINATION, FEBRUARY/MARCH 2014. Third Semester Computer Science Engineering DOS 282.- CRYPTOGRAPHY AND DATA SECURITY (Common to M.Se. Information Technology) (Regulations 2007/2009) ‘Three hours ‘Maximum : 100 marks Answer ALL questions, PART A — (10 x 2= 20 marks) List the properties of Modulo operator. What is Euler's totient? What is the difference between a block cipher and a stream cipher? What is steganography? Ina public key system using RSA, you intercept the ciphertext C =10 sent from an user whose public key is e = 5, n = 35. What is the plain text M? What requirements should a digital signature scheme satisfy? What types of attacks are addressed by message authentication? In what ways can a hash value be secured so as to provide message authentication? In the PGP scheme, what is the expected number of session keys generated before a previously created session key is produced? What are the services provided by IPSec? PART B— (6 x 16 = 80 marks) (@) (@ Using Fermat's theorem, find 8 *' mod 11, ®@ Gi) State and prove Chinese remainder theorem. ® Or (®) (@ State and explain Fermats theorem. (8) Gi) Show that if n is an odd composite integer, then the Miller-Rabin test will return inconclusive for a =1 and a =(n-1). @)12. 13. 14, 15. @) b) @) (a) (b) (a) ) () What are the various substitution techniques? Explain any two of them with examples. ® (i) Show that in the DES, the first 24 bits of each subkey come from the same subset of 28 bits of the initial key and that the second 24 bits of each subkey come from a disjoint subset of 26 bits of the initial key, ® Or (i) Explain the DES encryption algorithm with appropriate diagrams, @) Gi) Ifa bit error occurs in the transmission of a ciphertext character in 8 bit CFB node, how far does the error propagate? Explain. @) (Discuss in detail about the security of RSA. ) (ii) Users A and B use the Diffie- Hellman key exchange technique, with a common prime q = 71 and a primitive root a= 7. (1) Tfuser A has private key Xa = 5, what is A’s public key Ys? If user B has private key Xs = 12, what is B's public key Ya? (3) What is the shared secret key? 8 Or @ — Bsplain the symmetric oneryption approaches with examples, (8) (i) DSA specifies that if the signature process results in a value of 5 = 0, a new value of k should be generated and the signature be recalculated. Why? Explain with examples. ® Explain in detail about the various authentication function as) Or What is a MAC? Discuss in detail about the requirements of MAC. (16) Write notes on: @ Gi) @ S/MIME ® Key management. ® Or Write notes on: IPV6 authontication header © Web security. . ® «a 2 96414