Semester : SEMESTER 7
Subject : Cryptography and Network Security
Year : 2018
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 409
Page:2
14
15
16
17
18
19
a)
b)
G7907 Pages: 2
PART C
Answer any two full questions,each carries 9 marks.
Define Euler’s Totient Function. Prove that, (pq) = (p-1)(q-1), where 9 and و
are prime numbers.
Demonstrate Diffie Hellman Key exchange algorithm.
Illustrate the working of SHA-1 with diagrams.
What are the Security Requirements of message authentication?
Give the encryption/decryption procedures using Elliptic Curve Cryptography.
PART D
Answer any two full questions, each carries 12 marks.
Explain the sequence of steps involved in the message generation and reception
in Pretty Good Privacy (PGP) with block diagrams.
List out the security association (SA) parameters in IPSec.
Illustrate the working of Secure Electronic Transaction (SET) in detail.
Compare Packet filter and Application Level Gateways.
Explain the method of protecting IP datagram from replay attack using IPsec.
Explain the sequence of steps used in Secure Socket Layer handshake Protocol
for establishing a new session. Draw a diagram which shows the action of
Handshake Protocol.
KK
Page 2of 2
(5)
(4)
(9)
(4)
(5)
(8)
(4)
(8)
(4)
(6)
(6)