UNIVERSITY COLLEGE OF ENGINEERING (BIT CAMPUS) UNIVERSITY COLLEGE OF ENGINEERING (BIT CAMPUS)

TRICHIRAPPALLI TRICHIRAPPALLI
First Internal Assessment First Internal Assessment

B.E. (Computer Science and Engineering) – ‘B’ Section B.E. (Computer Science and Engineering) – ‘B’ Section
IV Year / VII Sem IV Year / VII Sem
Subject Code & Name: CS 6701 – Cryptography and Network Security Subject Code & Name: CS 6701 – Cryptography and Network Security
Date: 18-08-2017 Date: 18-08-2017
Marks: 50 Duration: 1.30 Hrs Marks: 50 Duration: 1.30 Hrs

Part-A Part-A
Answer All Questions 7 x 2 = 14 Answer All Questions 7 x 2 = 14
1. Compare active and passive attack with example. 1. Compare active and passive attack with example.
2. Find gcd(1970,1066) using Euclid’s algorithm. 2. Find gcd(1970,1066) using Euclid’s algorithm.
3. Brief the strength of triple DES. 3. Brief the strength of triple DES.
4. What is an elliptic curve? 4. What is an elliptic curve?
5. Define discrete algorithm with example. 8. Define discrete algorithm with example.
6. List the different modes of operation. 9. List the different modes of operation.
7. Name any two methods for testing prime numbers. 10. Name any two methods for testing prime numbers.
Part-B Part-B
Answer any Three Questions 3 x 12 = 36 Answer any Three Questions 3 x 12 = 36
8. a) Explain OSI Security Architecture model with neat diagram. (6) 8. a) Explain OSI Security Architecture model with neat diagram. (6)
b) Describe the various Security mechanisms. (6) b) Describe the various Security mechanisms. (6)
9. a) State Chinese Remainder Theorem and find X for the set of 9. a) State Chinese Remainder Theorem and find X for the set of
congruent equations using CRT. congruent equations using CRT.
X=2(mod 3) X=2(mod 3)
X=3(mod 5) X=3(mod 5)
X=2(mod 7) (6) X=2(mod 7) (6)
b) Convert the given text “anna university” into cipher text using rail b) Convert the given text “anna university” into cipher text using rail
fence. (2) fence. (2)
c) State and prove Fermat’s Theorem with example. (4) c) State and prove Fermat’s Theorem with example. (4)
10. Explain AES algorithm with all its round functions in details (12) 10. Explain AES algorithm with all its round functions in details (12)
11. a) Demonstrate encryption and decryption for the RSA algorithm 11. a) Demonstrate encryption and decryption for the RSA algorithm
parameters: p=7, q=11, e=17, M=8. (6) parameters: p=7, q=11, e=17, M=8. (6)
b) User A and User B use the Diffie-Hellman key exchange technique b) User A and User B use the Diffie-Hellman key exchange technique
with a common prime p=23 and a primitive root α=5. If user A has private with a common prime p=23 and a primitive root α=5. If user A has private
key XA=6, what is A’s public key? If user B has private key X B=15, what key XA=6, what is A’s public key? If user B has private key XB=15, what
is B’s public key? Also find the shared secret key of user A and user B. (6) is B’s public key? Also find the shared secret key of user A and user B. (6)