CNS Old Papers
CNS Old Papers
No:
Page 4 of 4 Page 1 of 4
17CS4703A VR17 17CS4703A
PART-B b. We assume that Ravan can observe all messages send from Alice
4 x 15 = 60M to Bob and vice versa. Ravan has no knowledge of any keys. State
whether and how MAC protect against each attack. The auth(x) is
UNIT-I
computed with a MAC algorithm.
2. a. Explain AES algorithm and draw a neat sketch. 8M i) Ram sends a message x = “Transfer Rs 1000/- to Sita” in the
clear and also sends auth(x) to Hanuman. Ravan intercepts the
b. What are the types of security attacks? Illustrate with examples. message and replaces “Sita” with “Ravan”. Will Hanuman detect
7M this?
ii) Ram sends a message x = “Transfer Rs 1000/- to Sita” in the
(or)
clear and also sends auth(x) to Hanuman. Ravan observes the
3. a. Is it possible to perform encryption operations in parallel on multiple message and sends them 100 times to Hanuman. Will Hanuman
blocks of plain text in CBC mode? How about decryption? 5M detect this?
iii) Ravan claims that he sent some message with a valid auth(x)
b. Describe PlayFair cipher and Rail Fence cipher with examples.
to Hanuman, but Ram claims the same. Can Hanuman clear the
10M
question in either case?
UNIT-II iv) Hanuman claims that he received a message x with a valid
signature auth(x) from Ram, but Ram claims he has never sent it.
4. a. In a public-key system using RSA, you intercept the ciphertext Can Ram clear this question in either case? 10M
C = 10 sent to a user whose public key is e = 5, n = 35. What is
plain text M? 7M UNIT-III
b. How hash code can be generated using SHA 512? Brief the 6. a. Differentiate between Kerberos version 4 and version 5. 7M
procedure. 8M
b. Explain how handshake protocol is implemented in TLS. 8M
(or)
(or)
5. a. What are the principal ingredients of a public-key cryptosystem?
5M 7. a. Discuss about web traffic security approaches. 8M
Page 2 of 4 Page 3 of 4