QN Pap 1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

H1 1100csT393122103

Reg No.:

APJ ABDUL KALAM TECHNOLOGICAL T]NIVERSI


Fifth semester B.Tech (Hons) De$ree Examination December 2021 (20r

Course Code: CST393


Course Name: CRYPTOGRAPHIC ALGORITHMS
Max. Marks: 100 Duration: 3 Hours
PART A
(Answer aII questions; each question carries 3 marks) Marks
1{ Differentiate between computationally secure cipher and unconditionally secure a
J

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

5 Explain how knapsack system is cracked. 3


6 Given p:7, g:ll, e:17, M:8, perform encryption using RSA algorithm. a
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

an exhaustive key search to break this Caesar cipher.

b) What are the different types of cryptanalytic attacks? 8

12 a) The encryption key in a transposition cipher is (3,1,4,5,2). perform encryption 6


and decryption for the message "meet me after the toga pargt". Add a bogus
character at the end to make the last group the same size as the others.
b) Explain OSI Security architecture model with suitable diagrams.

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

b) Discuss the sffeam cipher RC4 in detail. 6

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

Users private key are Xn:3 and Xs:5.


i. Find the Public keYs.
ii. Find the value of symmetric key.
iii. Write the algorithm
16 a) Discuss the encryption/decryptionprocedures using Elliptic Curve cryptography. 8

b) With fte following parameters, implement El-Gamal Encryption/ Decryption 6

scheme.

o Prime Number,p :l I
o Primitive root of p:g=2

: ;::H. il" ffi;:", B'o User A, M:3


o Random number chosen by User B for encryption' k:7
Determine
i. Public keY Y of A
ii. Ciphertext created by the sender'B
iii. Show how the plaintext is extracted from ciphertext by user A

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 :

',, , - 19 a) Illwe &e vtlx*ihg of SHA-5I2 algorithm with reraswy diagams. 10

S.. 4 ,Q*erm message auffi.**S *#AC. 8


< b) Describe @B. H gxp*riin-trcs it d€cfs the security of hash fuions. 6
, ***

.:l

:,:$:, , ,,t:f

,l l-
t
.'

:I

Page 3 of3

You might also like