SRM INSTITUTE OF S CIENCE AND TECHNOLOG Y

Ramapuram Campus, Bharathi Salai, Ramapuram, Chennai -

600089

FACULTY OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

QUESTION BANK

DEGREE / BRANCH: B.TECH-CSE- CYBER SECURITY

V SEMESTER

18CSE381T – CRYPTOGRAPHY

2018 Regulation

Academic Year 2020-2021 ODD SEMESTER

Prepared by
Dr M.AZHAGIRI ME.,MBA.,Ph.D
Assistant Professor
 SRM INSTITUTE OF SCIENCE AND TECHNOLOGY
Ramapuram Campus, Bharathi Salai, Ramapuram, Chennai-600089

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

QUESTION BANK

SUBJECT : 18CSE381T – CRYPTOGRAPHY

SEM/ YEAR: III/V

Course Outcomes
CLR-1 : Understand OSI security architecture and classical encryption techniques.
CLR-2 : Acquire fundamental knowledge on the concepts of finite fields and number
theory
CLR-3 : Understand various block cipher and stream cipher models
CLR-4 : Describe the principles of public key cryptosystems, hash functions and
digital signature.
CLR-5 : Gain a first-hand experience on encryption algorithms, encryption modes

UNIT I
Introduction to Cryptography and Network Security, OSI Security Architecture,
Introduction to Security attacks, Security mechanisms, Symmetric cipher model,
Substitution techniques: Caesar cipher, Play fair Cipher, Mono alphabetic cipher,
Poly alphabetic ciphers , Onetime pad, Hill Cipher -Encryption, Decryption,
Transposition techniques, Steganography
PART-A (Multiple Choice Questions)
Q. Questions Course Competen
No Outcome ce
BT Level
1 Which one is the strong attack mechanism?

A. Chosen plaintext attack

B. Chosen cipher text CO1 BT 1
C. Brute Force Attack
D. Man in the middle attack

2 Caesar cipher is an example of___________

A. Substitution cipher
B. Transposition cipher CO1 BT 1
C. Substitution as well as transposition
D. Steganography

3 Linear Cryptanalysis is a_____________ CO1 BT 1

 A. Known Plain Text Attack
B. Chosen Plain Text Attack
C. Known Cipher Text Attack
D. Chosen Cipher Text Attack

4 Tool for implementing security policy may be called

as___________

A. Security process
CO1 BT 1
B. Security authentication
C. Security gaps
D. Security mechanism

5 Which one of the following is active attack?

A. Masquerade
B. Traffic analysis CO1 BT 1
C. Eavesdropping
D. Shoulder Surfing

6 Which of the following security attacks is not an active

attack?

A. Masquerade
CO1 BT 1
B. Traffic analysis
C. Replay attack
D. Denial of Service

7 Any action that compromises the security of information

owned by an organization is called ___.

A. Security Service
CO1 BT 2
B. Security Mechanism
C. Man in Middle Attack
D. Security attack

8 Which Type Of Attack Can Actively Modify Data Or

communication_____________

A. Active Attack
CO1 BT 1
B. Passive Attack
C. Both Active Attack and Passive attack
D. Neither Active Attack nor Passive attack

9 Eve has intercepted the Cipher text “UVACLYFZLJBYL”

Show How She can Use a Brute Force Attack to break the
Cipher, with the Key of 7
CO1 BT 2
A. TUZBKXEYKIAXK
B. STYAJWDXJHZWJ
C. NOTVERYSECURE
 D. QRWYHUBVHFXUH

10 Use Caesar Cipher with Key 15 to encrypt the message ”

Hello”

A. WTAAD
CO1
B. WTBBD
C. XUAAE
D. XUBBE

11 We are provided the plain text “CYBERSECURITY”. You

need to convert the given plain text into cipher text
under the Ceasar cipher encryption technique. Which of
the following options is the correct cipher text for the
given text if the key is 15?
CO1 BT 2
A. RNQTGTHRJGXIN
B. RNQGTTHRJGXIN
C. RNQTGHTRJGXIN
D. RQNTGTTHRJGXI

12 Which of the following correctly defines poly alphabetic

cipher?

A. a substitution based cipher which uses multiple

substitution at different positions
B. a substitution based cipher which uses fixed
substitution over entire message CO1 BT 1
C. a transposition based cipher which uses multiple
substitution at different positions
D. a transposition based cipher which uses fixed
substitution over entire message

13 Encrypt the following text with poly alphabetic Cipher

the given key and find the cipher text
Plain Text "JAVA"
key "BEST"

A. KENT CO1 BT 1
B. KCNT
C. KESN
D. KEST

14 The system which has insufficient information available

to crypt-analyst is
CO1 BT 2
A. One-time pad
B. Unconditionally secure
C. Transposition
 D. One-time pad & Unconditionally secure

15 Use Hill Cipher with Key to encrypt the message ”

CSE”, The Key is given in the Matrix Format

A. YES
CO1 BT 1
B. YWS
C. YFS
D. YXS

16 Rail Fence Technique is an example of_______________

A. Substitution
B. Transposition CO1 BT 2
C. Product cipher
D. Caesar cipher

17 On Encrypting “THEPEPSIISINTHEREFRIGERATOR”
using Vignere Cipher System using the keyword
“HUMOR” we get cipher text____________

A. ABQDNWEWUWJPHFVRRTRFZNSDOKVL
CO1 BT 1
B. ABQDVMWUWJPHFVVYYRFZNYDOKVL
C. TBQYRVMWUWJPHFVVYYRFZNYDOKVL
D. BAIUVMWUWJPHFOEIYRFZNYDOKVL

18 Hill cipher requires prerequisite knowledge of____________

A. integration
B. differentiation CO1 BT 1
C. matrix algebra
D. differential equation

19 _____________ is hiding of data within data, where we can

hide images, text, and other messages within images,
videos, music or recording files.

A. Cryptography CO1 BT 1
B. Tomography
C. Steganography
D. Chorography

20 ____________ is another data hiding technique which can

be used in conjunction with cryptography for the extra-
secure method of protecting data.

A. Cryptography CO1 BT 1
B. Steganography
C. Tomography
D. Chorography
21 Which of the following is a type of transposition cipher?
A. Rail Fence cipher
B. Hill cipher
CO1 BT 1
C. Rotor cipher
D. One time pad

22 Because a transposition is a rearrangement of the

symbols of a message, it is also known as ___.

A. Combination
CO1 BT 1
B. Permutation
C. Integration
D. Differentiation

23 In which of the following cipher the plain text and the

ciphered text have same set of letters?

A. one time pad cipher

CO1 BT 1
B. columnar transposition cipher
C. play fair cipher
D. additive cipher

24 The relationship between a character in the plaintext to a

character is

A. many-to-one relationship
CO1 BT 1
B. one-to-many relationship
C. many-to-many relationship
D. one-to-one relationship

25 A transposition cipher reorders (permutes) symbols in a____

A. block of packets
B. block of slots
C. block of signals
D. block of symbols

PART B (4 Marks)
1 What is cryptanalysis and cryptography? CO1 BT 1
2 What are the key principles of security? CO1 BT 1
3 Define threat and attack. CO1 BT 1
4 Specify the four categories of security threads. CO1 BT 1
5 Differentiate between active and passive attacks CO1 BT 2
6 What are active and passive attack that compromise
CO1 BT 1
information security
7 What are the two basic functions used in encryption
CO1 BT 1
algorithms?
8 What is the difference between a mono alphabetic and a poly
CO1 BT 2
alphabetic cipher?
9 Compare Substitution and Transposition techniques? Give
CO1 BT 2
an example
10 Convert the text “srm university” into cipher text using rail
CO1 BT 2
fence technique
11 Decipher the following cipher text using brute force attack: CO1 BT 2
CMTMROOEOORW using rail fence algorithm
12 How will you perform attack on Hill Cipher? CO1 BT 2
13 List out the problems and its disadvantage of one time pad CO1 BT 2
encryption algorithm?
14 What is meant by affine cipher and block cipher? CO1 BT 2
15 What is the difference between an unconditionally secure CO1 BT 2
cipher and a computationally secure cipher
16 Why it is not practical to use an arbitrary reversible CO1 BT 2
substitution cipher?
17 How many keys are required for two people to communicate CO1 BT 2
via a cipher?
18 What are the two approaches to attacking a cipher? CO1 BT 2
19 What are the design parameters of Feistel cipher network? CO1 BT 2
20 Define steganography. List out its techniques CO1 BT 1

PART C (12 Marks)

1 (a) List and briefly define categories of security Mechanism
and
CO 1 BT 2
Security Services.
(b) Describe in detail about network security model.
2 (a) What are the different types of attacks? Explain.
(b) For a workstation in a typical business environment listCO 1 BT 2
potential locations for confidentiality attacks
3 Explain the OSI security architecture along with the
CO 1 BT 2
services available.
4 Explain in detail about classical crypto systems CO 1 BT 2
5 Explain any two types of cipher Technique in detail. CO 1 BT 2
6 (a) Using play fair cipher algorithm encrypt the message
using the key MONARCHY and explain it
(b) Given cipher text “YMJTYMJWXNIJTKXNQJSHJ”
knowing the message is encrypted by Caesar cipher and

k=5, Decrypt the message. 9 4 CO 1 BT 3

5 7
(c)Encrypt the message “EIGHT O CLOCK” using the hill

cipher with the key9 4

5 7
(d)State the rules to perform encryption using playfair
 cipher and encrypt “ SNOWSHOOOS” using the key
MONARCHY , I and J count as 1 letter and X is the filler
letter.
7 Explain the following with suitable examples Caesar
cipher, Playfair cipher, Transposition Technique & CO 1 BT 3
Vernam cipher in detail.
8 Convert “MEET ME” using Hill cipher with
the key matrix and convert the cipher text CO 1 BT 3
back to plaintext.
9 Write any two classical cryptosystems (Substitution
CO 1 BT 2
&Transposition) with examples.
 UNIT II
Groups, Rings, Fields-Modular arithmetic-Euclid's Algorithm-Polynomial Arithmetic-
Finite Fields-Prime Numbers, Testing for Primality-Fermat’s and Euler’s Theorem-
The Chinese remainder theorem-Discrete Logarithms
PART-A (Multiple Choice Questions)
Q. Questions Course Compete
No Outcome nce
BT Level
Consider the Following properties for Question 1 to 5
G-i) Closure
G-ii) Associative
G-iii) Identity Element
G-iv) Inverse Element
G-v) Commutative
R-i) Closure under multiplication
R-ii) Associativity of multiplication
R-iii) Distributive Law
R-iv) Commutativity of multiplication
R-v) Multiplicative Identity
R-vi) No zero divisors
R-vii) Multiplicative Inverse
1 An Abelian Group satisfies the properties
A. G-i to G-v
B. G-i to R-iv CO 2 BT 1
C. G-i to R-v
D. R-i to R-v
2 Ring is said to be commutative if it also satisfies the
property
A. R-vi
CO 2 BT 1
B. R-v
C. R-vii
D. R-iv
3 An ‘Integral Domain’ satisfies the properties
A. G-i to G-iii
B. G-i to R-v
CO 2 BT 1
C. G-i to R-vi
D. G-i to R-iii

4 a.(b.c) = (a.b).c is the representation for which

property?
A. G-ii
CO 2 BT 1
B. G-iii
C. R-ii
D. R-iii
5 All groups satisfy properties
A. G-i to G-v
CO 2 BT 1
B. G-i to G-iv
C. G-i to R-v
 D. R-i to R-v
6 What is the Discrete logarithm to the base 10 (mod 19)
for a =7?
A. 12
CO 2 BT 2
B. 14
C. 8
D. 11
7 Order of 3 in the group (Z5,+) is _______
A. 2
B. 5 CO 2 BT 2
C. 1
D. 3
8 5 mod 11 =
22

E. 3
F. 5 CO 2 BT 2
G. 6
H. 10
9 Let us consider the following statements
(i) (Z10, +) is a cyclic group
(ii) (Z, +)is not a cyclic group
Select the correct option from below
CO 2 BT 2
A. and (ii) both are true
B. and (ii) both are false
C. Only (i) is true
D. Only (ii) is true
10 Find the GCD of 1111 and 51 using Euclid's Algorithm

A. 1
CO 2 BT 2
B. 2
C. 3
D. 4
11 What is 11 mod 7 and -11 mod 7?

A. 4 and 5
B. 4 and 4 CO 2 BT 2
C. 5 and 3
D. 4 and -4

12 Find the Modular Multiplicative Inverse of 5 mod 26

A. 7
B. 14 CO 2 BT 2
C. 21
D. 20
13 Find the Prime Factorization Of 369
A. 3*3*43
B. 3*5*41 CO 2 BT 2
C. 3*3*43
D. 3*3*41
14 On multiplying (x6+x4+x2+x+1) by (x7+x+1) in GF (28)
with irreducible polynomial (x 8 + x4 + x3 + x + 1) we get
A. x7+x6+ x3+x2+1
B. x6+x5+ x2+x+1 CO2 BT 3
C. x7+x6+1
D. x7+x6+x+1

15 Determine ϕ(21)
A. 1, 2, 4, 5, 8, 10, 11, 13, 16, 17, 19, 20
B. 1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 13, 15, 16, 17,
18, 19, 20, 21
CO2 BT 3
C. 1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 16, 17, 19, 20,
21
D. 1, 2, 4, 5, 8, 10, 11, 13, 16, 17, 19, 20, 21

16 Determine ϕ(15)
A. 1,2,3, 4,6,7,8,9,11,12,13,14,15
B. 1,2,4,5,7,8,10,11,13,14,15
CO2 BT 3
C. 1,2,4,7,8,11,13,14
D. 1,2,4,7,8,11,13,14, 15

17 If f(x)=x7+x5+x4+x3+x+1 and g(x)=x3+x+1, find f(x) *

g(x).
A. x12+x5+x3+x2+x+1
B. x10+x4+1 CO2 BT 3
C. x10+x4+x+1
D. x7+x5+x+1

18 Which test denotes the deterministic primality

testing
A. Fermat’s test
CO2 BT 1
B. AKS Algorithm
C. Millar-Rabin test
D. Solovay-Strassen test
19 The relation between Fermat test and the Miller–
Rabin test is
A. Miller–Rabin test outputs probable prime
imply that the Fermat test also outputs
probable prime
B. If the Fermat test outputs probable prime then CO2 BT 2
the Miller–Rabin test also outputs probable prime
C. If the Miller–Rabin test outputs probable prime
then n is definitely prime
D. If the Fermat test outputs probable prime then n
is definitely prime
20 If n=5461 then in Fermat's Primality Testing
A. 680 and 16 both fail to prove n a prime
CO2 BT 2
B. 16 is a witness that n may be prime but 680 is
not
 C. 680 is a witness that n may be prime but 16 is
not
D. both 680 and 16 are witness that n may be prime
21 Let p>=5 be a prime number. Which of the following
statements are true?
A. On input p, the Miller-Rabin algorithm says that
p is prime with probability at most 0.5
B. On input p, the Miller-Rabin algorithm says
CO2 BT 2
that p is prime with probability 1
C. On input p, the Miller-Rabin algorithm says that
p is prime with probability at least 1.5
D. On input p, the time taken for Miller-Rabin
algorithm could be exponential in the size of p
22 Solve the Congruence 3X≅ 4 (mod 5)
A. x≅ 3 mod 5
B. x≅ 4 mod 5 CO2 BT 3
C. x≅ 2 mod 5
D. x≅6 mod 5
23 Find the solution to the simultaneous equation by
Applying Chinese Remainder Theorem
x ≅ 2 mod 3
x ≅ 3 mod 5
x ≅ 2 mod 7
CO2 BT 3
A. 105
B. 33
C. 23
D. 12

24 Apply Chinese Remainder Theorem to solve

x≅3 mod 9; x≅ 7 mod 13 the common solution is

A. x≅ 107 mod 117

CO2 BT 3
B. x≅ 103 mod 117
C. x≅ 111 mod 117
D. x≅ 105 mod 117

25 Calculate the discrete logarithm log 2 11 modulo 13

A. 2
B. 3 CO2 BT 3
C. 5
D. 7
 PART B (4 Marks)

1 What is meant by Groups? CO 2 BT 1

2 Define Rings and Ring with unity with an example CO 2 BT 2

3 Define LFSR Sequences with an example CO 2 BT 2

4 Define Finite fields with an example CO 2 BT 2

5 Define Modular arithmetic with an example CO 2 BT 2

6 What is modular exponentiation? CO 2 BT 1

7 Define Euclidian algorithm and Find the GCD of 2740 and CO 2 BT 3

1760 using Euclidian algorithm
8 What is meant by extended Euclidian algorithm CO 2 BT 3

9 Define Polynomial Arithmetic. And write the expression for CO 2 BT 1

addition and subtraction of two polynomials.
10 Write the algorithm for checking given number is prime or CO 2 BT 2
not?
11 Why random numbers are used in network security? CO 2 BT 2

12 What is meant by Primality Test? Name any two methods. CO 2 BT 2

13 When an integer Alpha, less than n is said to be the CO 2 BT 2

primitive root of n?
14 What is the use of Fermat’s theorem? CO 2 BT 2

15 Define primitive root. Show that 3 is a primitive root of 7. CO 2 BT 2

16 Define Euler’s function and find the values of Φ 35 and Φ CO 2 BT 3

27.
17 What is discrete logarithm problem? CO 2 BT 1

18 Where the miller-rabin algorithm is used? CO 2 BT 2

19 Define congruence’s, with an Example CO 2 BT 2

20 What is the role of discrete logarithms in network security? CO 2 BT 2

PART C (12 Marks)

1 Explain The Rule of number theory in Cryptography CO 2 BT 2

2 Explain in detail about (i) Groups (ii) Rings (iii) Fields with CO 2 BT 2
an example
3 (a) State Euclid‟s algorithm and find the inverse of 550 mod CO 2 BT 3
1759.
(b) Explain Extended Euclid‟s algorithm with an example.
4 Explain Finite Fields with their application in cryptography. CO 2 BT 2

5 Let f(x)= x 6+ x 4 +x 2+x +1 and g(x)= x 7+x+1 with an CO 2 BT 3

irreducible polynomial m(x)= x 8+ x 4+x 3+x+1. Multiply f(x)
by g(x) in GF(2 8)
6 Explain Fermat and Euler’s theorem with an example. CO 2 BT 2

7 Write short notes on the following with an example CO 2 BT 3

(i) Fermat Primality Test
(ii)Miller-Rabin Primality Test
(iii) Strassen Primality Test.
8 Write short notes on Chinese Remainder theorem with an CO 2 BT 3
example x ≅ 2 mod 3; x ≅ 3 mod 5; x ≅ 2 mod 7
9 State and explain Chinese Remainder theorem using the CO 2 BT 3
same. Find an integer that has remainder of 3 when divided
by 7, 4 when divided by 13, but it is divisible by 12.
10 How discrete logarithm is evaluated for a number? What is CO 2 BT 3
the role of discrete logarithms in network security?
 UNIT III
Block cipher principles-Introduction-Data Encryption Standard-DES Example,
Strength of DES- Block cipher Modes of operation – Multiple Encryption-Block
cipher Modes of operation –Triple DES , Electronic Code Book, Cipher Block
Chaining Mode-Cipher Feedback Mode, Output Feedback Mode and Counter Mode
Advanced Encryption Standard – Structure and Transformation Functions-AES
Key Expansion and AES Example- Blowfish-RC5 algorithm
PART-A (Multiple Choice Questions)
Q. Questions Course Competence
No Outcome BT Level

1 Consider a linear Feedback shift Register (LFSR) with m CO 3 BT 2

bit seed, Then the maximum period of t LFSR is
A. 2m-1
B. m2
C. m
D. m-1
2 Which one of the following is not a cryptographic CO 3 BT 1
algorithm?
A. JUPITER
B. Blowfish
C. Serpent
D. RC5

3 If the key is 110100001, the output of the SP network CO 3 BT 2

for the plaintext:101110001 is
A. 110100011
B. 110101110
C. 10110111
D. 11111010
4 Which of the following statement is true CO 3 BT 2
(i)Block Cipher can reuse Keys
(ii)Stream Cipher are faster than block Ciphers
A. only (i)
B. only(ii)
C. Both (i) and (ii)
D. Neither (i) and (ii)
5 ______ Increases the redundancy of plain text CO 3 BT 1
A. Confusion
B. Diffusion
C. Both Confusion and Diffusion
D. Neither Confusion Nor Diffusion
6 In affine block cipher systems if f(m)=Am + t, what is CO 3 BT 2
f(m1+m2+m3) ?
A. f(m1) + f(m2) + f(m3) + t
 B. f(m1) + f(m2) + f(m3) +2t
C. f(m1) + f(m2) + f(m3)
D. 2(f(m1) + f(m2) + f(m3))
7 In the DES algorithm the round key is __________ bit CO 3 BT 2
and the Round Input is ____________bits
A. 48, 32
B. 64,32
C. 56, 24
D. 32, 32
8 In the DES algorithm the Round Input is 32 bits, which CO 3 BT 1
is expanded to 48 bits via ____________
A. Scaling of the existing bits
B. Duplication of the existing
C. bits Addition of zeros
D. Addition of ones
9 In DES , The Initial Permutation table/matrix is of size CO 3 BT 1
A. 16×8
B. 12×8
C. 8×8
D. 4×8
10 The number of unique substitution boxes in DES after CO 3 BT 1
the 48 bit XOR operation are
A. 8
B. 4
C. 6
D. 12
11 Assume input 10-bit key, K: 10100 00010 for the SDES CO 3 BT 2
algorithm. What is K1?
A. 01000010
B. 10110110
C. 11010000
D. 10100111
12 Which of the following modes of operations can be CO 3 BT 1
followed for both stream ciphers as well as block
ciphers?
A. CBC (Cipher Block Chaining)
B. ECB (Electronic Code Book)
C. CFB (Cipher text Feed Back)
D. Counter Mode
13 Which of the following is false for ECB mode of CO 3 BT 2
operation?
( i) The Plain text is broken into blocks of size 128 bytes
(ii) Blocks can be swapped, repeated, replaced without
recipient noticing
(iii) Good for short data
(iv) Encryption of each block is done separately using a
randomly generated key for each block
A. (i) only
 B. (i) and (iii)
C. (i) and (iv)
D. (i) (ii) and (iv)
14 Which of the following statements are true CO 3 BT 2
(i) In the CBC mode, the plaintext block is XORed with
previous ciphertext block before encryption
(ii) The CTR mode does not require an Initialization
Vector
(iii) The last block in the CBC mode uses an
Initialization Vector
(iv) In CBC mode repetitions in plaintext do not show up
in ciphertext
(A). (i) only (iii)
(B). (iii) and (iv)
(C). Only (i)
(D). (ii) and (iv)
15 What is the fault in the above figure? CO 3 BT 2

A. The output of the XOR is sent to the next

stage
B. The “Encrypt” Box should be replaced by
“Decrypt Box”
C. b-s bits are selected for the XOR operation
D. No fault

16 In which method, key-stream is generated CO 3 BT 1

independently?
A. Synchronous
B. Self-synchronous
C. Synchronous & Self synchronous
D. Neither Synchronous nor Self synchronous
17 Using Linear Crypt-analysis, the minimum computations CO 3 BT 2
required to decipher the DES algorithm is
A. 2^48
B. 2^43
C. 2^56
D. 2^64
18 Using Differential Crypt-analysis, the minimum CO 3
computations required to decipher the DES algorithm is
A. 2^56
B. 2^43
C. 2^55
D. 2^47
19 For the AES-128 algorithm there are __________ similar CO 3 BT 2
rounds and _________ round is different.
A. 2 pair of 5 similar rounds , every alternate
B. 9 , the last
C. 8 , the first and last
D. 10 , no
20 Match the following symmetric block ciphers with CO 3 BT 2
corresponding block and key sizes:
List – I
(a) DES
(b) IDEA
(c)BLOW FISH
(d)AES
List – II
(i)block size 64 and key size ranges between 32 and 448
(ii) block size 64 and key size 64
(iii)block size 128 and key sizes 128, 192, 256
(iv)block size 64 and key size 128

(1) (a)-(iv) (b)-(ii) (c)-(i) (d)-(iii)

(2) (a)-(ii) (b)-(iv) (c)-(i) (d)-(iii)
(3) (a)-(i) (b)-(ii) (c)-(iii) (d)-(iv)
(4) (a)-(iv) (b)-(ii) (c)-(iii) (d)-(i)

21 A Group (M,*) is said to be abelian if______________ CO 3 BT 2

A. (x+y)=(y+x)
B. (x+y)=x
C. (x*y)=(y*x)
D. (x*y)=(y+x)
22 The total number of subkeys t used in the RC5 CO 3 BT 2
algorithm is given by the formula (r corresponds to
number of rounds)
A. t=2r+4
B. t=2r
C. t=2r+2
D. d) t=2r-2
23 Which RC5 mode will have the cipher text longer than CO 3 BT 2
the plaintext by at most the size of a single RC5
BLOCK?
A. RC5 Block Cipher
B. RC5 Block Cipher Chaining
C. RC5 Block Cipher Chaining Pad
D. RC5 Block Cipher Text Stealing
24 Which of the following is true for the RC5 algorithm? CO 3 BT 2
i) Has variable number of rounds
ii) Has fixed Key length
iii) High memory Requirements
iv) Uses only primitive computational operations
 commonly found on microprocessors

A. i) and iv)
B. i) ii) and iv)
C. iv)
D. d) i) ii) and iii)
25 What are the allowable values of word size in bit for RC5 CO 3 BT 1
algorithm?
A. 16, 32
B. 16, 32, 64
C. 8, 16, 32
D. d) 16, 32, 48
PART B (4 Marks)

1 What do you mean by linear and differential cryptanalysis? CO 3 BT 1

2 What is the difference between statistical randomness and CO 3 BT 2

unpredictability?
3 Write down the difference between the public key and a CO 3 BT 2
private key cryptosystems
4 What is the difference between Diffusion and Confusion? CO 3 BT 2

5 What is the difference between a strong and a week collision CO 3 BT 2

resistance?
6 What types of attack are addressed by DES algorithm? CO 3 BT 1

7 How is the S-box constructed? What is the purpose of the S- CO 3 BT 2

boxes in DES?
8 What are the Advantages and disadvantages of double DES? CO 3 BT 1

9 Point out the types of cryptanalysis attacks. CO 3 BT 1

10 What are the different modes of operation in DES? . CO 3 BT 1

11 If a bit error occurs in plain text block p1, how far does the CO 3 BT 2
error propagate in CBC mode of DES and 8-bit CFB mode of
DES?
12 What was the final set of criteria used by NIST to evaluate CO 3 BT 1
candidate AES Ciphers.
13 What is AES cipher? List out the parameters of AES. CO 3 BT 1

14 What is the purpose of the State array? CO 3 BT 1

15 Whether there is an addition of round key before the start of CO 3 BT 2

the AES round algorithms? Yes/No state the Reason
16 In RC5-CBC-Pad mode, the cipher will be longer than the CO 3 BT 2
plaintext at most the size of a single RC5 block, why?
17 Write the working procedure of Blowfish in single round CO 3 BT 1

18 What primitive operation is used in RC5? CO 3 BT 1

19 What is meant by RC5 algorithm and write its characteristics CO 3 BT 1

of RC5
20 What is the block size of MD5 and how many bits are CO 3 BT 2
produced as the message digest?
PART C (12 Marks)

1 Explain the about working principle, Key Generation, CO 3 BT 2

Encryption and Decryption of Simple DES algorithm in
 detail with an example.
2 Write down the triple DES algorithm and explain with neat CO 3 BT 2
diagram.
3 i. Explain about the Single round of DES algorithm CO 3 BT 2
ii. Describe Key discarding process of DES.
4 i. Draw the general structure of DES and explain encryption CO 3 BT 2
decryption process.
ii. Mention the strengths and weakness of DES algorithm.
5 Explain in Detail about Modes of operation of DES algorithm CO 3 BT 2

6 Explain how encryption is done using Advanced Encryption CO 3 BT 2

Standards with necessary block diagrams.
7 i. Explain the generation of sub key and S-Box from given CO 3 BT 2
32-bit key by Blowfish.
ii. In AES, how the encryption key is expanded to produce
keys for the 10 rounds
8 List out and explain different types of cryptanalytic attacks CO 3 BT 2
with suitable example
9 Explain about Blowfish in detail CO 3 BT 2

10 Explain about RC4 algorithm and RC5 algorithm in detail CO 3 BT 2

 UNIT IV
Principles of Public-key Cryptosystems - Structure and key management-Principles of Public-
key Cryptosystems – Applications for Public-key Cryptosystems- Requirements for Public-key
Cryptosystems and Public – Key Cryptanalysis-RSA algorithm - Key management-RSA algorithm
- Encryption and Decryption- Diffie Hellman key exchange – Algorithm, Key Exchange Protocols-
Diffie Hellman key exchange – Man-in-the- Middle Attack- Elliptic curve: Arithmetic – Abelian
Groups, Elliptic Curves over Real Numbers -Elliptic Curves over Zp, Elliptic Curves over
GF(2m)-Elliptic Curve Cryptography
PART-A (Multiple Choice Questions)
Q. Questions Course Competen
No Outcome ce
BT Level
1 A sender is employing public key cryptography to send a CO 4 BT 1
secret message to a receiver. Which one of the following
statements is TRUE?
A. Sender encrypts using receiver’s public key
B. Sender encrypts using his own public key
C. Receiver decrypts using sender’s public key
D. Receiver decrypts using his own public key
2 Cipher system can be solved effectively by statistically CO 4 BT 1
using_______________
A. Time of occurrence
B. Frequency of occurrence
C. Length of the message
D. Time of the message

3 CO 4 BT 1
Knapsack problem can be solved by_________
A. Public key cryptosystem
B. Private key cryptosystem
C. Public & Private key cryptosystem
D. Secret Key Cryptosystem

4 In public key cryptosystem which is kept as public? CO 4 BT 1

A. Encryption keys
B. Decryption keys
C. Encryption & Decryption keys
D. Session Key
5 A user sends an encrypted message that was encrypted CO 4 BT 1
using asymmetric cryptography. What does this
recipient need to receive the message?

A. Recipient's private key

B. Sender's private key
C. Sender's public key
D. Recipient's public key
6 Which of the following public key distribution systems CO 4 BT 1
is most secure?

A. Public-Key Certificates
 B. Public announcements
C. Publicly available directories
D. Public-Key authority
7 A total of seven messages are required in the Public- CO 4 BT 1
Key distribution scenario. However, the initial five
messages need to be used only infrequently because
both A and B can save the other’s public key for future
– a technique known as ____
A. time stamping
B. polling
C. caching
D. squeezing
8 Which of these systems use timestamps as an CO 4 BT 1
expiration date?
A. Public-Key Certificates
B. Public announcements
C. Publicly available directories
D. Public-Key authority
9 Which systems use a timestamp? CO 4 BT 2
(i) Public-Key Certificates
(ii) Public announcements
(iii) Publicly available directories
(iv) Public-Key authority

A. (i) and (ii)

B. (iii) and (iv)
C. (i) and (iv)
D. (iv) only
10 Which one of the following is not a public key distribution CO 4 BT 1
means?
A. Public-Key Certificates
B. Hashing Certificates
C. Publicly available directories
D. Public-Key authority
11 Euler’s totient function is determined by CO 4 BT 1
A. pq
B. (p-1)(q-1)
C. (p+1)(q+1)
D. p/q
12 How many bit keys are common in Asymmetric encryption? CO 4 BT 1
A. 64
B. 128
C. 160
D. 1024
13 For p = 11 and q = 19 and choose e=17. Apply RSA CO 4 BT 3
algorithm where message=5 and find the cipher text.

A. C=80
B. C=92
C. C=56
D. C=23
14 Which of the following encryption methods deals with CO 4 BT 3
two distinct large prime numbers and the inability to
factor those prime numbers?

A. RSA
B. Symmetric
C. WPA
D. d. SHA-1
15 In the RSA public key cryptosystem, the private and CO 4 BT 3
public keys are (e, n) and (d, n) respectively, where n = p
x q and p and q are large primes. Besides, n is public
and p and q are private. Let M be an integer such that 0
< M < n and f(n) = (p-1)(q-1).
Now consider the following equations-
I. M’ = Me mod n and M = (M’)d mod n
II. ed ≡ 1 mod n
III. ed = 1 mod f(n)
IV. M’ = Me mod f(n) and M = (M’)d mod f(n)
Which of the above equations correctly represent RSA
cryptosystem?
A. I and II
B. I and III
C. II and IV
D. III and IV
16 Suppose You are using RSA Algorithm based CO 4 BT 3
cryptosystem to securely share the number of marbles
that you have currently with you currently with your
friends. The Private key that you are using is (3, 15)
Your Friends know the corresponding public key
(11,15), one of your friend wants to share the exact
amount of marble content only to you, what are the
maximal possible marbles your friend can have so that
he/she can secretly share that to you
A. 10
B. 12
C. 14
D. 16

17 Suppose Allice And Bob use the Diffie Hellman Key CO 4 BT 2

Exchange technique with a technique with a common
prime p=23 and a primitive root g=7, if alice choose the
secret key a=3 and bob choose the secret key b=6 then
the common secret key shared between alice and bob is
________
A. 16
B. 18
C. 20
D. 22

18 In a Diffie-Hellman Key Exchange, Alice and Bob have CO 4 BT 2

chosen prime value q = 17 and primitive root = 5. If
 Alice’s secret key is 4 and Bob’s secret key is 6, what is
the secret key they exchanged?
A. 16
B. 17
C. 18
D. 19

19 Publicly Available directory is more secure than which CO 4 BT 1

other system?
A. Public-Key Certificates
B. Public announcements
C. Public-Key authority
D. Public-Key Directory
20 In Singular elliptic curve, the equation x^3+ax+b=0 does CO 4 BT 1
roots

A. does not have three distinct

B. has three distinct
C. has three unique
D. has three distinct unique

21 Which of the following statements is incorrect about CO 4 BT 2

elliptic curve cryptography algorithm?
A. Elliptic curve cryptography algorithm is a public
key algorithm.
B. Key sizes in an elliptic curve cryptography
algorithm are in the order of 1024 bits.
C. Elliptic curve cryptography works with points on a
curve.
D. In elliptic curve cryptography algorithm, elliptic
curve is designed by the equation y 2 = x3 + ax + b

22 An Elliptic curve is a set of solutions to an equation CO 4 BT 2

y2=x3+ax+b together with an extra point O where
constants and A and B satisfy
A. 4B3+27A2 ≠ 0
B. 4A3+27B2 ≠ 0
C. 4B2+27A3 ≠ 0
D. 4A2+27B3 ≠ 0

23 Computation of the discrete logarithm is the basis of the CO 4 BT 1

cryptographic system _______
A. Symmetric cryptography
B. Asymmetric cryptography
C. Diffie-Hellman key exchange
D. Secret key cryptography
24 Which of the following algorithms is a symmetric-key CO 4 BT 1
cryptography algorithm?
A. RSA algorithm
B. IDEA algorithm
 C. Elliptic curve discrete logarithm
D. Diffie-Hellman algorithm

25 “Meet in the middle attack” is an attack CO 4 BT 1

A. where the timing required for the attack via brute
force is drastically reduced
B. where the adversary uses 2 or more machines to
decrypt thus trying to reduce the time
C. where messages are intercepted and then either
relayed or substituted with another message
D. where cryptanalysis takes lesser time than the brute
force decryption
PART B (4 Marks)

1 List four general characteristics of schema for the CO 4 BT 1

distribution of the public key.
2 Write down the two different uses of public-key cryptography CO 4 BT 1
related to key distribution.
3 State weather symmetric and asymmetric cryptographic CO 4 BT 2
algorithms needs key exchange
4 What are the types of certificates? CO 4 BT 1

5 What is meant by public key authority and public key CO 4 BT 1

certificates
6 What is key distribution center? CO 4 BT 1

7 Find the primitive roots of 11. CO 4 BT 2

8 When an integer Alpha, less than n is said to be the primitive CO 4 BT 2

root of n?
9 What is the role of session key in public key schemes? CO 4 BT 1

10 State the significance of blinding in RSA? CO 4 BT 1

11 What attacks are possible on RSA algorithm? CO 4 BT 1

12 User A and B exchange the key using Diffie-Hellman CO 4 BT 2

algorithm. Assume α=5 q=11 XA=2 XB=3. Find the value of
YA, YB and k.
13 What is man in the middle attack? How it occurred and how CO 4 BT 2
it can be solved.
14 For the group Sn of all permutations of n distinct symbols, CO 4 BT 2
a. what is the number of elements in Sn?
b. show that Sn is not abelian for n > 2.
15 What is the zero point of an elliptic curve? CO 4 BT 1

16 What is meant by Elliptic curve arithmetic CO 4 BT 1

17 What are elliptic curve cryptosystems? CO 4 BT 1

18 Why Elliptic Curve Cryptography is considered to be better CO 4 BT 1

than RSA?
19 What is the sum of three points on an elliptic curve that lie CO 4 BT 2
on a straight line?
20 Does the elliptic curve equation y2 = x 3 + x + 2 define a CO 4 BT 2
group over Z7?
PART C (12 Marks)

1 What are the Requirements for Public-key Cryptosystems? CO 4 BT 2

Explain in detail.
2 i. Explain in detail about Principles of Public-key CO 4 BT 2
Cryptosystems
ii. What are the Applications of Public-key Cryptosystems
3 Explain in detail about Public Key Infra structure and CO 4 BT 2
certificate hierarchy
4 Describe Key Management System in detail. CO 4 BT 2

5 i. Write the algorithm of RSA and explain with an example. CO 4 BT 3

Perform decryption and encryption using RSA algorithm
with p=3; q=11; e=7 and N=5.
ii. What attacks are possible on RSA algorithm?
6 Briefly explain Diffie Hellman key exchange with an example. CO 4 BT 3
Consider a diffie Hellman Scheme with a common prime
q=353 and primitive root α=3. Users A and B have private
keys XA=17 and XB=21. What is the shared secret key K1
and K2
7 Users A and B use the Diffie Hellman key exchange CO 4 BT 3
technique, a common prime q=11 and a primitive root
alpha=7.
(i) If user A has private key XA=3.What is A’s public key YA?
(ii) If user B has private key XB=6 what is B’s public key YB?
(iii) What is the shared secret key? Also write the algorithm.
(iv) How man in middle attack can be performed in Diffie
Hellman algorithm.
8 State the requirements for the design of an Elliptic Curve CO 4 BT 3
Crypto system. Using that, explain how secret keys are
exchanged and messages are encrypted?
9 i. Explain in detail about Elliptic Curves over Real Numbers CO 4 BT 3
ii. How does Elliptic Curves over GF(2^m) take part in
Encryption and Decryption Process?
10 Demonstrate that the two elliptic curves of Figure each CO 4 BT 3
satisfy the conditions for a group over the real numbers.
 UNIT V
Message Authentication Codes- Requirements for Message Authentication Codes-Applications of
Cryptographic Functions - Message Authentication-Two Simple Hash Function-Security
Requirements for Cryptographic hash Functions-Hash Algorithms - MD5-Hash Algorithms -
SHA-Digital Signature Standard-Applications pertaining to Encryption using different ciphers
and modes-One-way hash algorithms.
PART-A (Multiple Choice Questions)
Q. Questions Course Competen
No Outcome ce
BT Level
1 CO 5 BT 2

Which figure implements confidentiality and authentication?

A
B
C
D
2 For a 150-bit message and a 10-bit MAC, how many CO 5 BT 2
values are the MAC value dependent on?

A. 2^140
B. 2^150
C. 2^15
D. 2^10

3 Message Authentication Code belongs to which type of CO 5 BT 1

mapping_____________
A. One-to-One mapping
B. Many-to-One mapping
C. Onto Mapping
D. One to Many mapping
4 Which of the following are authentication algorithms CO 5 BT 1
A. HMAC
B. AES
C. DES
D. RSA
5 Consider the following properties: CO 5 BT 2
Variable Input size, Fixed Output size, Efficiency, Pre
image resistant, Second Pre image Resistant, Collision
resistant, Pseudo randomness
 A hash function that satisfies the first _______ properties
in the above table is referred to as a weak hash
function.

A. 2
B. 3
C. 4
D. 5
6 Which attack requires the least effort/computations? CO 5 BT 1
A. Pre-image
B. Second Pre-image
C. Collision
D. All required the same effort
7 The hash function ___________ CO 5 BT 1
A. Has manageable collision
B. Has high unmanageable level of collision
C. Collision Creator
D. Is collision free

8 What is the output of a cryptographic hash function CO 5 BT 2

means?
A. A variable set of bits
B. A fixed set of bits, derived from one-way
mathematical operations
C. An output which may be easily discovered by an
adversary
D. Outputs of such functions are of no importance

9 Consider the following two Statements CO 5 BT 2

(i) A Hash Function is an injective function
(ii) Encryption technique such as DES perform a
permutation on the elements of its input alphabet
Which one of the following option is valid for the above
two statements
A. Statement (i) False and (ii) False
B. Statement (i) True and (ii) False
C. Statement (ii) True and (i) False
D. Statement (i) True and (ii) True
10 Let h be a cryptographic hash function, then which of CO 5 BT 2
the following statement is true
(i) For any given hash value y, it is
computationally infeasible to find x such that
y=h(x)
(ii) For any given value x, it is computationally
infeasible x1 ≠ x such that h(x1)=h(x)
A. Only (i) True
B. Only (ii) True
C. (i) and (ii) Both are True
D. (i) and (ii) Both are False
11 Input size of MD4 and MD5 is _________ bits CO 5 BT 2
A. 160
B. 256
C. 512
D. 1024

12 In Public Key crypto System, the Message Digest is CO 5 BT 1

signed by________
A. Sender Public Key
B. Sender Private Key
C. Receiver Public Key
D. Receiver Private Key

13 SHA 1 Takes a Message with a maximum length less CO 5 BT 2

than ___ bits and Produces an output of ______ bit
message digest
A. 2128 , 160
B. 2 64, 160
C. 2128 , 256
D. 2 64, 256

14 Digest created by a hash Function is normally called as CO 5 BT 1

________
A. Modification detection code
B. Modify authentication connection
C. Message authentication control
D. Message authentication cipher

15 A(n)___________can be used to prevent the integrity of a CO 5 BT 1

document or a message

A. Message Digest
B. Message Summary
C. Encrypted Message
D. Decrypted Message

16 When a hash function is used to provide message CO 5 BT 1

authentication, the hash function value is referred to as
A. message field
B. message digest
C. message score
D. message leap

17 Digital signature provides___________ CO 5 BT 1

A. Authentication
B. Nonrepudiation
C. Both (A) and (B)
 D. Neither (A) nor (B)

18 In Public Key crypto System, the Message Digest is signed CO 5 BT 1

by________
A. Sender Public Key
B. Sender Private Key
C. Receiver Public Key
D. Receiver Private Key

19 Using public key cryptography, X adds a digital CO 5 BT 2

signature σ to message M, encrypts <M, σ>, and sends it
to Y, where it is decrypted. Which one of the following
sequences of keys is used for the operations?
A. Encryption: X’s private key followed by Y’s private
key; Decryption: X’s public key followed by Y’s
public key
B. Encryption: X’s private key followed by Y’s public
key; Decryption: X’s public key followed by Y’s
private key
C. Encryption: X’s public key followed by Y’s private
key; Decryption: Y’s public key followed by X’s
private key
D. Encryption: X’s private key followed by Y’s
public key; Decryption: Y’s private key
followed by X’s public key

20 A sender S sends a message m to receiver R, which is CO 5 BT 2

digitally signed by S with its private key. In this
scenario, one or more of the following security violations
can take place.
(I) S can launch a birthday attack to replace m with a
fraudulent message.
(II) A third party attacker can launch a birthday attack
to replace m with a fraudulent message.
(III) R can launch a birthday attack to replace m with a
fraudulent message.
Which of the following are possible security violations?
A. (I) and (II) only
B. (I) only
C. (II) only
D. (II) and (III) only

21 Which of the following is not a type of digital signature? CO 5 BT 1

A. Approval Signatures
B. Non-Certified Signatures
C. Visible Digital Signature
D. Invisible Digital Signature
22 In Digital Signature algorithm, Suppose users public CO 5 BT 2
key is PK= {p=7, q=3, g=4 g^xmod p=2} users private key
is SK=x=5 and the Secret Key number is k=2, Consider
a Messgage M with message digest h=HAsh(M)=3 , Then
the Users Signature for the message M is
(r,s)=______________

A. (3,3)
B. (3,2)
C. (2,3)
D. (2,2)

23 What can be the technique to avoid collision in a hash CO 5 BT 1

function?

A. Use hash function appear random

B. Use the chaining method use uniform
hashing
C. Use hash function appear random,
D. Chaining method and uniform hashing

24 Select the Correct Option CO 5 BT 2

A. A Digital Signature Scheme is combination of only

one algorithm
B. The Verification Key of a digital signature
scheme is publicly available but the signing
key is kept secret
C. The Verification Key of a digital signature scheme
is held secret, but the Signing key is made public

D. A randomized signing algorithm will result in

falure during verification process

25 Which one of the following is not an application hash CO 5 BT 1

functions?
A. One-way password file
B. Key wrapping
C. Virus Detection
D. Intrusion detection
PART B (4 Marks)
1 What is message authentication? List the roles of CO 5 BT 1
Authentication services.
2 What are the functions used to produce an authenticator? CO 5 BT 1

3 What are the types of attacks are addressed by message CO 5 BT 2

authentication?
4 What is meant by message authentication code? Specify the CO 5 BT 2
requirements for message authentication.
 5 Define the classes of message authentication function. CO 5 BT 1

6 Differentiate MAC and Hash function. CO 5 BT 2

7 What do you meant by hash function? List any three hash CO 5 BT 1

algorithm.
8 What is the role of compression function in hash function? CO 5 BT 1

9 State the reason why SHA is more secure than MD5? CO 5 BT 2

10 Compare MD5, SHA1 and RIPEMD-160 algorithm. CO 5 BT 2

11 Draw the Message Digest generation format of MD5. CO 5 BT 1

12 Explain Single round function of MD5 with neat diagram CO 5 BT 2

13 List the properties a digital signature should possess? CO 5 BT 1

14 Mention the fundamental idea of HMAC & CMAC. CO 5 BT 1

15 What is a digital Signature? What are the two approaches of CO 5 BT 1

digital signatures?
16 Distinguish between direct and arbitrated digital signature? CO 5 BT 2

17 In what ways can a hash value be secured so as to provide CO 5 BT 2

message authentication?
18 List the applications pertaining to Encryption using different CO 5 BT 1
ciphers and modes
19 What is one-way property? CO 5 BT 1

20 Define One-way hash algorithms. CO 5 BT 1

PART C (12 Marks)

1 Draw and explain the MAC using neat diagrams and list its CO 5 BT 2
applications
2 Explain in detail about Message Authentication Code and its CO 5 BT 2
requirements.
3 (i).Apply the MAC on the cryptographic checksum method to CO 5 BT 3
authenticate builds confidentiality of the message where the
authentication is tied to message. M=8376, K1=4892,
K2=53624071?
(ii).What are the properties a hash function must satisfy?
4 Describe the MDS message digest algorithm with necessary CO 5 BT 2
block diagram.
5 Explain about MD5 in detail and describe MD5 processing of CO 5 BT 2
a single 512 bit block with neat diagram
6 Discuss clearly Secure Hash Algorithm to generate message CO 5 BT 2
digest in detail.
7 Write a detailed note on Digital signatures standards. CO 5 BT 2

8 What are Digital Signature algorithms and show how signing CO 5 BT 2

and verification is done using DSS.
9 Explain in detail about Applications pertaining to CO 5 BT 2
Encryption using different ciphers and modes
10 Explain in Detail about One-way hash algorithms. CO 5 BT 2

Note:
 1. BT Level – Blooms Taxonomy Level

2. CO – Course Outcomes

BT1 – Remember
BT2 – Understand
BT3 – Apply
BT4 – Analyze
BT5 – Evaluate
BT6 – Create