QN Pap 1
QN Pap 1
QN Pap 1
Reg No.:
cipher.
2 "Passive attacks are easier to prevent but difficult to detect. On the other hand, J
active attacks are difficult to prevent but easy to detect". Justiff this assertion.
a a
J Illustrate the key expansion procedure of IDEA algorithm. J
4 Identi$r the drawbacks of double DES and why do we go for triple DES. J
7 List four general categories of schemes for the distribution of public keys. a
J
8 Demonstrate how simple secret key distribution is prone to man in the middle a
J
attack.
9r If the length of the message is 6143 bits, how many padding bits are needed in a
J
SHA?
10 List out the required properties of a good Hash function. a
J
PART B
(Answer one fuII question from each moda,4 each question carries 14 marks)
Module -1
11 a) Eve has intercepted the ciphertext "trvACLYFZLlsYL". Show how she can use
Page 1 of 3
1100csr393122103
Module -2
.
l3 a) Explain the Key expansion in AES algorithm with a neat sketch. :r 10
4
b) Differentiate between confusion and diffirsion.
l4 a) Describe single round of DES algorithm with necessary diagrams. 8
Module -3
15 a) Explain RSA algorithm. Prove that the RSA decryption indeed recovers the 8
original plaintext.
k_ b) Consider a Diffie-Hellmann scheme with a prime g:23 and a primitive root c:7. 6
scheme.
o Prime Number,p :l I
o Primitive root of p:g=2
Module -4
8
t7 ,a) Explain secret key distribution with confidentiality and authentication.
6
b) What are the key components of a PKI? Briefly describe each component'
18 a) Define a session key and show how a KDC can create a session key between
Alice and Bob.
Page 2 of 3
':
:.=
i+
-- " |
i,.
F-
b) Dsitethefo&*irg *.
i. Backup Keys
------f -- t .
' ': ii. Compromis€df€rJs \ 6
Module -5 :
.:l
:,:$:, , ,,t:f
,l l-
t
.'
:I
Page 3 of3