DATA ENCRYPTION AND CRYPTOGRAPHY QUIZ BANK

“Rabin/ Elgamal Algorithm”.

1. “Rabin Cryptosystem is a variant of the Elgamal Cryptosystem”

a) True
b) False
Correct Answer

Answer: b
Explanation: Rabin Cryptosystem is a variant of the RSA Cryptosystem.

2. Using Rabin cryptosystem with p=23 and q=7

Encrypt P=24 to find ciphertext. The Cipher text is
a) 42
b) 93
c) 74
d) 12
Correct Answer

Answer: b
Explanation: Calculate n = p × q = 161
Plaintext P = 24
Ciphertext = C ≡ P2 (mod n)
= 242 mod 161 = 93 mod 161
Ciphertext transmitted = 93.

3. Which Cryptographic system uses C1 = (e1r) mod p and C1 = (e2r x P) mod p at the
encryption side?
a) Elgamal
b) RSA
c) Rabin
d) Whirlpool
Correct Answer

Answer: a
Explanation: The Elgamal cryptographic system uses the above formulae to compute the CT.

4. Sender chooses p = 107, e1 = 2, d = 67, and the random integer is r=45. Find the plaintext
to be transmitted if the ciphertext is (28,9).
a) 45
b) 76
c) 66
d) 13
Answer with explanation
Answer: c
Explanation: P = [C2 (C1d)-1] mod p = 66.

5. In Elgamal cryptosystem, given the prime p=31.

Choose e1= first primitive root of p and d=10, calculate e2.
a) 24
b) 36
c) 25
d) 62
Correct Answer

Answer: c
Explanation: We choose e1=3 (a primitive root of p = 31) and d=10. Then we have e2 = 310
mod 31 = 25.

6. In Elgamal cryptosystem, given the prime p=31.

Encrypt the message “HELLO”; use 00 to 25 for encoding. The value of C2 for character „L‟
is
a) 12
b) 07
c) 20
d) 27
Correct Answer

Answer: d
Explanation:The Common factor for the calculation of C2 is e7 mod 31 = 257 mod 31 = 25.
P = “L” = 11; C1 = 37 mod 31 = 17; C2 = 11 x 25 mod 31 = 27; C = (17,27).

7. In Elgamal cryptosystem, given the prime p=31.

Encrypt the message “HELLO”; use 00 to 25 for encoding. The value of C2 for character „O‟
is
a) 09
b) 07
c) 23
d) 27
Correct Answer

Answer: a
Explanation:The Common factor for the calculation of C2 is e7 mod 31 = 257 mod 31 = 25.
P = “O” = 14; C1 = 37 mod 31 = 17; C2 = 14 x 25 mod 31 = 09; C = (17,09).
advertisement

8. In Elgamal cryptosystem, given the prime p=31.

What is the respective plaintext character for C = (27, 20)?
a) H
b) L
c) O
d) M
Correct Answer
Answer: a
Explanation: The Common factor for the calculation of C2 is e7 mod 31 = 257 mod 31 = 25.
C = 17, 20); P = 20 X (1710)-1 mod 31 = 07; “07” = “H”.

“Knapsack/ Merkle – Hellman/ RSA Cryptosystem”.

9. Imagine you had a set of weights {62, 93, 26, 52, 166, 48, 91, and 141}. Find subset that
sums to V = 302.
a) {62, 48, 166, 52}
b) {141, 26, 52, 48}
c) {93, 26, 91, 48}
d) {62, 26, 166, 48}
Correct Answer

Answer: d
Explanation: {62, 26, 166, 48} =302.

10. For the Knapsack: {1 6 8 15 24}, Find the cipher text value for the plain text 10011.
a) 40
b) 22
c) 31
d) 47
Correct Answer

Answer: a
Explanation: 1+15+24 = 40.

11. For the Knapsack: {1 6 8 15 24}, find the plain text code if the ciphertext is 38.
a) 10010
b) 01101
c) 01001
d) 01110
Correct Answer

Answer: b
Explanation: If someone sends you the code 38 this can only have come from the plain text
01101.

12. Set {1, 2, 3, 9, 10, and 24} is superincreasing.

a) True
b) False
Correct Answer

Answer: b
Explanation: It is not because 10 < 1+2+3+9.

13. A superincreasing knapsack problem is ____ to solve than a jumbled knapsack.

a) Easier
b) Tougher
c) Shorter
d) Lengthier
Correct Answer

Answer: a
Explanation: A superincreasing knapsack is chosen to make computations easier while
manual calculations of knapsack problems.

14. Consider knapsack that weighs 23 that has been made from the weights of the
superincreasing series {1, 2, 4, 9, 20, and 38}. Find the „n‟.
a) 011111
b) 010011
c) 010111
d) 010010
Correct Answer

Answer: b
Explanation: v0=1, v1=2, v2=4, v3=9, v4=20, v5=38
K=6, V=23
Starting from largest number:
v5 > V then ϵ_5=0
v4 < V then V = V – v4 = 23 – 20 = 3 ϵ_4=1
v3 > V then ϵ_3=0
v2> V then ϵ_2=0
v1 < V then V = V – v1= 3 – 2 = 1 ϵ_1=1
v0 =1 then V = V – v0= 1 – 1 = 0 ϵ_0=1
n= ϵ_5 ϵ_4 ϵ_3 ϵ_2 ϵ_1 ϵ_0 = 010011.

15. Another name for Merkle-Hellman Cryptosystem is

a) RC4
b) Knapsack
c) Rijndael
d) Diffie-Hellman
Correct Answer

Answer: b
Explanation: Knapsack is another name for Merkel-Hellman Cryptosystem.

16. In Merkle-Hellman Cryptosystem, the hard knapsack becomes the private key and the
easy knapsack becomes the public key.
a) True
b) False
Correct Answer

Answer: b
Explanation: The hard knapsack becomes the public key and the easy knapsack becomes the
private key.

17. In Merkle-Hellman Cryptosystem, the public key can be used to decrypt messages, but
cannot be used to decrypt messages. The private key encrypts the messages.
a) True
b) False
Correct Answer

Answer: b
Explanation: The public key can be used to encrypt messages, but cannot be used to decrypt
messages. The private key decrypts the messages.

18. The plaintext message consist of single letters with 5-bit numerical equivalents from
(00000)2 to (11001)2. The secret deciphering key is the superincreasing 5-tuple (2, 3, 7, 15,
31), m = 61 and a = 17. Find the ciphertext for the message “WHY”.
a) C= (148, 143, 50)
b) C= (148, 143, 56)
c) C= (143, 148, 92)
d) C= (148, 132,92)
Correct Answer

Answer: a
Explanation: {wi }= {a vi mod m}
{wi} = { 17×2 mod 61, 17×3 mod 61, 17×7 mod 61, 17×15 mod 61, 17×31 mod 61}
{wi} = {34, 51, 58, 11, and 39}
PlainText In binary Ci
W- 22 10110 148
H – 7 00111 143
Y – 24 11000 50
So that the ciphertext sent will be C= (148, 143, 50).

19. For p = 11 and q = 17 and choose e=7. Apply RSA algorithm where PT message=88 and
thus find the CT.
a) 23
b) 64
c) 11
d) 54
Correct Answer

Answer: c
Explanation: n = pq = 11 × 19 = 187.
C=Me mod n ; C=887 mod 187 ; C = 11 mod 187.

20. For p = 11 and q = 17 and choose e=7. Apply RSA algorithm where Cipher message=11
and thus find the plain text.
a) 88
b) 122
c) 143
d) 111
Correct Answer

Answer: a
Explanation: n = pq = 11 × 19 = 187.
C=Me mod n ; C=1123 mod 187 ; C = 88 mod 187.
advertisement
21. In an RSA system the public key of a given user is e = 31, n = 3599. What is the private
key of this user?
a) 3031
b) 2412
c) 2432
d) 1023
Correct Answer

Answer: a
Explanation: By trail and error, we determine that p = 59 and q = 61. Hence f(n) = 58 x 60 =
3480.
Then, using the extended Euclidean algorithm, we find that the multiplicative
inverse of 31 modulo f(n) is 3031.

22. Compute private key (d, p, q) given public key (e=23, n=233 ´ 241=56,153).
a) 35212
b) 12543
c) 19367
d) 32432
Correct Answer

Answer: c
Explanation: Since n=233 ´ 241=56,153, p=233 and q=241
f(n) = (p – 1)(q – 1) = 55,680
Using Extended Euclidean algorithm, we obtain
d = 23–1 mod 55680 = 19,367.

“Knapsack/ Merkle – Hellman/ RSA Cryptosystem”.

23. Find the ciphertext for the message {100110101011011} using superincreasing sequence
{ 1, 3, 5, 11, 35 } and private keys a = 5 and m=37.
a) C = ( 33, 47, 65 )
b) C = ( 65, 33, 47 )
c) C = ( 47, 33, 65 )
d) C = ( 47, 65, 33 )
Correct Answer

Answer: c
Explanation: {vi} = { 1, 3, 5, 11, 35 }
a = 5 and m = 37
Public key generation:
{wi} = avi mod m
wi = {5, 15, 25, 18, 27}
Break the message into k-bit tuple i.e. 5-bit tuple
10011 01010 11011
Encoding of M as follows:
M Ci
10011 47
01010 33
11011 65
Ciphertext sent will be: C = (47, 33, and 65).

24. Suppose that plaintext message units are single letters in the usual 26-letter alphabet with
A-Z corresponding to 0-25. You receive the sequence of ciphertext message units 14, 25, 89.
The public key is the sequence {57, 14, 3, 24, 8} and the secret key is b = 23, m = 61.
Decipher the message. The Plain text is
a) TIN
b) INT
c) KIN
d) INK
Correct Answer

Answer: b
Explanation: Solve using Knapsack Cryptosystem.
Wi = {57, 14, 3, 24, 8}
b = 23 and m = 61
a = b-1 mod m
61 = 2 x23 + 15
23 = 1x 15 + 8 Therefore 1= 8 x 23 – 3 x 61
15 = 1x 8 + 7 b-1 = 23-1= 8
8 = 1x 7 + 1 a = 8
v_i=a^(-1) w_i mod m
=bw_i mod m
v_i={ 30, 17, 8, 3, 1}

Cipher text V = bC mod m Plaintext

14 23 x 14 mod 61 = 17 01000 = 8 = I
25 23 x 25 mod 61 = 26 01101 = 13 = N
89 23 x 89 mod 61 = 34 10011 = 19 = T.

25. RSA is also a stream cipher like Merkel-Hellman.

a) True
b) False
Correct Answer

Answer: a
Explanation: RSA is a block cipher system.

26. In the RSA algorithm, we select 2 random large values „p‟ and „q‟. Which of the
following is the property of „p‟ and „q‟?
a) p and q should be divisible by Ф(n)
b) p and q should be co-prime
c) p and q should be prime
d) p/q should give no remainder
Correct Answer

Answer: c
Explanation: „p‟ and „q‟ should have large random values which are both prime numbers.
27. In RSA, Ф(n) = _______ in terms of p and q.
a) (p)/(q)
b) (p)(q)
c) (p-1)(q-1)
d) (p+1)(q+1)
Correct Answer

Answer: c
Explanation: Ф(n) = (p-1)(q-1).

28. In RSA, we select a value „e‟ such that it lies between 0 and Ф(n) and it is relatively
prime to Ф(n).
a) True
b) False
Correct Answer

Answer: b
Explanation: gcd(e, Ф(n))=1; and 1 < e < Ф(n).

29. For p = 11 and q = 19 and choose e=17. Apply RSA algorithm where message=5 and find
the cipher text.
a) C=80
b) C=92
c) C=56
d) C=23
Correct Answer

Answer: a
Explanation: n = pq = 11 × 19 = 209.

30. For p = 11 and q = 19 and choose d=17. Apply RSA algorithm where Cipher message=80
and thus find the plain text.
a) 54
b) 43
c) 5
d) 24
Correct Answer

Answer: c
Explanation: n = pq = 11 × 19 = 209.
C=Me mod n ; C=517 mod 209 ; C = 80 mod 209.

31. USENET falls under which category of public key sharing?

a) Public announcement
b) Publicly available directory
c) Public-key authority
d) Public-key certificates
Correct Answer
Answer: a
Explanation: Many users have adopted the practice of appending their public key to messages that
they send to public forums, such as USENET newsgroups and Internet mailing lists.

32. p = 3; q = 11; M = 5
a) 28
b) 26
c) 18
d) 12
Correct Answer

Answer: b
Explanation: n = 33; f(n) = 20; d = 3; C = 26.

33. p = 5; q = 11; M = 9
a) 43
b) 14
c) 26
d) 37
Correct Answer

Answer: b
Explanation: n = 55; f(n) = 40; d = 27; C = 14.

34. p = 7; q = 11; M = 8
a) 19
b) 57
c) 76
d) 59
Correct Answer

Answer: b
Explanation: n = 77; f(n) = 60; d = 53; C = 57.

35. p = 11; q = 13; M = 7

a) 84
b) 124
c) 106
d) 76
Correct Answer

Answer: c
Explanation: n = 143; f(n) = 120; d = 11; C = 106.

36. p = 17; q = 31; M = 2

a) 254
b) 423
c) 128
d) 523
Correct Answer
Answer: c
Explanation: n = 527; f(n) = 480; d = 343; C = 128.

37. n = 35; e = 5; C = 10. What is the plaintext (use RSA) ?

a) 3
b) 7
c) 8
d) 5
Correct Answer

Answer: d
Explanation: Use RSA system to decrypt and get PT = 5.

“RC4 and RC5”.

38. Which of the following is true for the RC5 algorithm?

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) i) ii) and iii)
Correct Answer

Answer: a
Explanation: RC5 algorithm can have a variable key length and requires low amount of
memory.

39. What are the allowable values of word size in bit for RC5 algorithm?
a) 16, 32
b) 16, 32, 64
c) 8, 16, 32
d) 16, 32, 48
Correct Answer

Answer: b
Explanation: Word sizes in bits for RC5 algorithm can be 16, 32 or 64.

40. The number of rounds in RC5 can range from 0 to _____________

a) 127
b) 63
c) 255
d) 31
Correct Answer

Answer: c
Explanation: Number of Rounds range from 0 to 255.
41. The standard/nominal version of the RC5-w/r/b has parameters w/r/b as
a) 32/18/16
b) 16/18/16
c) 32/12/16
d) 32/16/18
Correct Answer

Answer: c
Explanation: Nominal/Standard version is RC5-32/12/16.
-i.e. 32-bit words, so encrypts 64-bit data blocks
-using 12 rounds
-with 16 bytes (128-bit) secret key.

42. The total number of subkeys t used in the RC5 algorithm is given by the formula (r
corresponds to number of rounds)
a) t=2r+4
b) t=2r
c) t=2r+2
d) t=2r-2
Correct Answer

Answer: c
Explanation: The total number of keys used in the RC5 algorithm is given by the formula
t=2r=2.

43. RC5 uses 2 magic constants to define their subkeys. These are
a) Base of natural Logarithm and Golden ratio
b) Base of natural Logarithm and Pi
c) Golden Ratio and Pi
d) Pi and Golden Ration
Correct Answer

Answer: a
Explanation: The initialize operations makes use of magic constants defined as follows:
P_w=Odd[(e-2) 2w].
Q_w=Odd[(φ-1) 2w].

44. The value of the base of natural logarithms is

a) e= 2.7073
b) e= 2.7183
c) e= 3.7183
d) e= 1.7273
Correct Answer

Answer: b
Explanation: The base of natural log i.e. „e‟ has a value 2.7183.

45. The value of the golden ratio is

a) ᶲ =2.618
b) ᶲ =1.622
c) ᶲ =1.743
d) ᶲ =1.618
Correct Answer

Answer: d
Explanation: The value of the golden ratio is 1.618.

46. In RC5, the initialization operations makes use of magic constants defined as follows:
P_w=Odd[(e-2) 2w].
Q_w=Odd[(φ-1) 2w].
What is the hexadecimal value of Pw for word size of 16 bits?
a) B7DF
b) B7D4
c) B7E1
d) B6E2
Correct Answer

Answer: c
Explanation: Pw is B7E1 for „w‟ of the size 16 bits.
advertisement

47. In RC5, the initialization operations makes use of magic constants defined as follows:
P_w=Odd[(e-2) 2w].
Q_w=Odd[(φ-1) 2w].
What is the hexadecimal value of Qw for word size of 32 bits?
a) 9D3779B4
b) 9D7779F9
c) 9E36D9B2
d) 9E3779B9
Correct Answer

Answer: d
Explanation: Pw is 9E3779B9 for „w‟ of the size 32 bits.

48. Calculate the number of subkeys required in RC5 for 18 rounds of computation.
a) 40
b) 38
c) 36
d) 34
Correct Answer

Answer: b
Explanation: Using the formula t=2r+2 we get number of subkeys as 38.

49. RC5 encryption uses Right shift and decryption uses Left shift.
a) True
b) False
Correct Answer
Answer: b
Explanation: RC5 encryption rounds use left shift operations and the decryption uses right
shift operations.

50. The code bellow is the RC5 encryption pseudo code in C language.
What is the error?
LE0 = A + S[0];
RE0 = B + S [1];
for i = 1 to r do
LEi = ((LEi-1 ⊕ REi-1) >>> REi-1) + S [2xi];
REi = ((REi-1 ⊕ LEi) <<< LEi) + S [2xi+1];

a) The left shift operation (should be right shift)

b) The right shift operation (should be left shift)
c) LEi-1 and REi-1 should be LEi and REi
d) The for loop runs from 1 to r-1 ( not 1 to r)
Correct Answer

Answer: b
Explanation:
Correct code –
LE0 = A + S[0];
RE0 = B + S [1];
for i = 1 to r do
LEi = ((LEi-1 ⊕ REi-1) <<<REi-1) + S [2xi];
REi = ((REi-1 ⊕ LEi) <<< LEi) + S [2xi+1];

51. “RC5 uses the Feistel Structure.”

a) True
b) False
Correct Answer

Answer: b
Explanation: RC5 does not use the classic Feistel structure.

52. Find the error in the Decryption pseudo code for RC5 –
for i = 1 to r do
RDi-1 = ((RDi – S [2xi+1] >>> LDi ) ⊕ LDi);
LDi-1 = ((LDi – S [2xi] >>> RDi-1) ⊕ RDi-1);
B= RD0 + S [1];
A = LD0 – S [0];

a) B= RD0 + S [1];
b) for i = 1 to r do
c) LDi-1 = ((LDi – S [2xi] >>> RDi-1) ⊕ RDi-1);
d) A = LD0 – S [0];
Correct Answer
Answer: a
Explanation: B= RD0 + S [1]; is incorrect as there should be a „-‟ instead.

53. Which one of the following is not a RC5 mode of operation?

a) RC5 block cipher
b) RC5-Cipher Block Chaining
c) RC5-Cipher Padding
d) RC5-CipherText Stealing
Correct Answer

Answer: c
Explanation: RFC 2040 [BALD96] defines four different modes of operation:
1. RC5 block cipher
2. RC5-CBC
3. RC5-CBC-Pad
4. RC5-CTS.

54. Which RC5 mode will have the ciphertext longer than the plaintext by at most the size of
a single RC5 block?
a) RC5 block cipher
b) RC5-Cipher Block Chaining
c) RC5-Cipher Block Chaining Pad
d) RC5-CipherText Stealing
Correct Answer

Answer: c
Explanation: The Cipher Block Chaining Pad mode produces a ciphertext output as such.

55. Which of these is not a characteristic of block ciphers?

a) Variable key length / block size / number of rounds
b) Mixed operators, data/key dependent rotation
c) Key independent S-boxes
d) More complex key scheduling
Correct Answer

Answer: c
Explanation:
Features seen in modern block ciphers are:
– Variable key length / block size / number of rounds
– Mixed operators, data/key dependent rotation
– Key dependent S-boxes
– More complex key scheduling
– Operation of full data in each round
– Varying non-linear functions.

56. Which one of the following RC4 algorithm not used in?
a) SSL
b) TLS
c) FTP
d) WEP
Correct Answer

Answer: c
Explanation: RC4 is used in Secure Socket Layer, Transport Layer Security and Wired
Equivalency Privacy. Not used in File Transfer Protocol.

57. Till when was the RC4 algorithm kept a secret?

a) 1990
b) 1992
c) 1996
d) 1994
Correct Answer

Answer: d
Explanation: In September 1994, the RC4 algorithm was anonymously posted on the Internet
on the Cypherpunks anonymous remailers list.

58. RC4 algorithm uses the concept of Block Cipher System.

a) True
b) False
Correct Answer

Answer: b
Explanation: RC4 algorithm uses the concept of Stream Cipher and uses a “stream key”.

59. How many computation rounds does the simplified AES consists of?
a) 5
b) 2
c) 8
d) 10
Correct Answer

Answer: b
Explanation: The simplified AES has only 2 rounds of computation.

60. For the case of Mixed Columns and Inverse Mixed Columns, is it true that b(x) = a-
1
(x)mod(x4 + 1)
where a(x) = {03}x3 + {01}x2 + {01}x + {02} and b(x) = {0B}x3 + {0D}x2 + {09}x + {0E}
a) True
b) False. The expression for a(x) is wrong.
c) False. The expression for b(x) is wrong.
d) False. Both a(x) and b(x) are faulty.
Correct Answer

Answer: a
Explanation: The statment is true and can be checked as it is similar to the matrix forms of
mixed columns and inverse mixed columns.
61. For an inputs key of size 128 bits constituting of all zeros, what is w(7) ?
a) {62 63 63 63}
b) {62 62 62 62}
c) {00 00 00 00}
d) {63 63 63 62}
Correct Answer

Answer: a
Explanation: Applying the key algorithm we get,
w(0) = {00 00 00 00}; w(1) = {00 00 00 00}; w(2) = {00 00 00 00}; w(3) = {00 00 00 00};
w(4) = {62 63 63 63}; w(5) = {62 63 63 63}; w(6) = {62 63 63 63}; w(7) = {62 63 63 63}.

62. On comparing AES with DES, which of the following functions from DES does not have
an equivalent AES function?
a) f function
b) permutation p
c) swapping of halves
d) xor of subkey with function f
Correct Answer

Answer: c
Explanation: There is no equivalent to swapping of halves in the AES algorithm.

63. On perform the Mix Columns transformation for the sequence of bytes “77 89 AB CD”
we get output
a) {01 55 EE 4A}
b) {0A 44 EF 4A}
c) {08 55 FF 3A}
d) {09 44 DD 4A}
Correct Answer

Answer: c
Explanation: Perform the mix columns transformation to obtain the output {08 55 FF 3A}.

64.On perform the Mix Columns transformation for the sequence of bytes “67 89 AB CD”
we get output
a) {08 55 FF 18}
b) {28 45 EF 08}
c) {28 45 FF 18}
d) {25 35 EF 08}
Correct Answer

Answer: b
Explanation: Perform the mix columns transformation to obtain the output {28 45 EF 0A}.

65. Is the following matrix the inverse matrix of the matrix used in the mix columns step?
x3 + 1 x
x x3 + 1
a) Yes
b) No
c) Can‟t say
d) Insufficient Information
Correct Answer

Answer: a
Explanation: On multiplying this matrix with the mix columns matrix we get the identity
matrix, this proves that it is an inverse matrix.

66. For the cipher text 0000 0111 0011 1000 and Key 0110 1111 0110 1011, apply the
Simplified AES to obtain the plaintext. The plain text is
a) 0110 1001 0111 0001
b) 0110 1111 0110 1011
c) 0010 1001 0110 1011
d) 1111 0101 0111 1111
Correct Answer

Answer: b
Explanation: On applying the simplified AES we would obtain 0110 1111 0110 1011 as the
plain text.

66. What is the block size in the Simplified AES algorithm?

a) 8 bits
b) 40 bits
c) 16 bits
d) 36 bits
Correct Answer

Answer: b
Explanation: The block size for the AES algorithm is 16 bits.
advertisement

67. What is the key size in the S-AES algorithm?

a) 16 bits
b) 32 bits
c) 24 bits
d) None of the mentioned
Correct Answer

Answer: a
Explanation: The key size in the S-AES algorithm is 16 bits.

68. S-AES and S-DES were both developed by the same person as an educational
cryptography system to teach students
a) True
b) False
Correct Answer
Answer: a
Explanation: None.

69. Which of the following is a faulty S-AES step function?

a) Add round key
b) Byte substitution
c) Shift rows
d) Mix Columns
Correct Answer

Answer: b
Explanation: The correct version in S-AES would be nibble substitution as 4 bits are taken at
a time.

70. How many modes of operation are there in in DES and AES?
a) 4
b) 3
c) 2
d) 5
Correct Answer

Answer: d
Explanation: DES has 5 modes of operation.

71. Which one of the following modes of operation in DES is used for operating short data?
a) Cipher Feedback Mode (CFB)
b) Cipher Block chaining (CBC)
c) Electronic code book (ECB)
d) Output Feedback Modes (OFB)
Correct Answer

Answer: c
Explanation: The Electronic code book mode is used for operating on short data as the same
key is used for each block. Thus repetitions in Plain Text lead to repetitions in Cipher Text.

72. Which of the following is false for ECB mode of 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) ii) and iii)
c) i) and iv)
d) i) ii) and iv)
Correct Answer
Answer: c
Explanation: Block size is 64 bits. The same Key is used for each block.

73. Which of the following statements are true

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) iii)
b) ii) and iv)
c) All the Statements are true
d) i) ii) and iv)
Correct Answer

Answer: d
Explanation: The first block in CBC mode uses an IV.

74. There is a dependency on the previous „s‟ bits in every stage in CFB mode. Here „s‟ can
range from ___
a) 8-16 bits
b) 8-32 bits
c) 4-16 bits
d) 8-48 bits
Correct Answer

Answer: b
Explanation: The range of the output of each stage of the cipher system is 8-32 bits for a 64
bit system.

75. Which mode of operation has the worst “error propagation” among the following?
a) OFB
b) CFB
c) CBC
d) ECB
Correct Answer

Answer: d
Explanation: The ECB or electronic code book mode of operation propagates the most errors.
A single bit error is carried onto the next block and so on.

76. Which block mode limits the maximum throughput of the algorithm to the reciprocal of
the time for one execution?
a) OFB
b) CTR
c) CBC
d) ECB
Correct Answer
Answer: b
Explanation: The CTR mode of operation limits the maximum throughput of the algorithm to
the reciprocal of the time for one execution.

77. Which mode requires the implementation of only the encryption algorithm?
a) ECB
b) CBC
c) CTR
d) OFB
Correct Answer

Answer: c
Explanation: The CTR mode only requires the implementation of either the encryption or
decryption phase. Both the phases are somewhat similar.

78. Which of the following modes of operation does not involve feedback?
a) ECB
b) CBC
c) CTR
d) OFB
Correct Answer

Answer: a
Explanation: Electronic code book does not involve feedback.

79. Which of the following is a natural candidates for stream ciphers?

a) OFB
b) CFB
c) CBC
d) ECB
Correct Answer

Answer: a
Explanation: OFB and CTR both produce outputs that are independent of both PT and CT.
Thus they are ideal candidates for stream ciphers.

80. The XTS-AES mode was approved by NIST in

a) 1999
b) 2010
c) 2006
d) 2002
Correct Answer

Answer: b
Explanation: The XTS-AES mode of operation was approved by NIST in 2010. It is the most
recent mode of operation for block ciphers.

81. The XTS-AES mode is based on the concept of tweakable block cipher.
a) True
b) False
Correct Answer

Answer: a
Explanation: The XTS-AES mode uses a tweak thus the name.

82. The purpose of a „tweak‟ in XTS-AES mode is to

a) secure the public key
b) provide security
c) provide variability
d) all of the mentioned
Correct Answer

Answer: c
Explanation: The purpose of the „tweak‟ in the XTS-AES mode is to provide variability in
each round.

83. A tweak is used in XTS-AES mode to provide a different output for the same input PT
and same key.
a) True
b) False
Correct Answer

Answer: a
Explanation: The statement is true for XTS-AES mode of operation.

84. XTS-AES mode of operation is a better version of

a) OFB
b) CFB
c) CTR
d) ECB
Correct Answer

Answer: d
Explanation: XTS-AES mode overcomes the principle security weakness of ECB, which is
that two encryptions of the same CT yeild the same PT.

85. What is the size of the XTS-AES key?

a) 1024 bits
b) 64 bits
c) 512 bits
d) 128 bits
Correct Answer

Answer: c
Explanation: The key size can be either 256 bits or 512 bits. There are 2 keys of the same size
K1 and K2.

86. Which of the following represent the tweak?

a) j
b) i
c) alpha
d) alphaj
Correct Answer

Answer: b
Explanation: „i‟ represents the tweak value.
advertisement

87. Which of the following is true for the tweak in XTS-AES mode?
a) they are non-negative integers
b) they are of size 128 bits
c) they are assigned consecutively
d) all of the mentioned
Correct Answer

Answer: d
Explanation: All of the statements are true in relation to the tweak „i‟ from the XTS-AES
mode of operation.

88. Which of the following is the correct encryption statement representation for the XTS-
AES mode?
a) E(K1,P) XOR T
b) E(K2,T) XOR P
c) E(K1,T XOR P) XOR P
d) E(K1,P XOR T) XOR T
Correct Answer

Answer: d
Explanation: The correct encryption representation would be : C = E(K1,P XOR T) XOR T.

89. The last two blocks of the XTS-AES mode are –

a) padded as 10*
b) encrypted/ decrypted using ciphertext-stealing
c) padded as 10*1
d) padded and then swapped after encryption/ decryption
Correct Answer

Answer: b
Explanation: The correct term used to encrypt/ decrypt the last 2 blocks is „cipher-text
stealing‟ where C(m) and C(m-1) are interchanged with each other.

90. How many step function do Round 1 and 2 each have in S-AES?
a) 4 and 3
b) Both 4
c) 1 and 4
d) 3 and 4
Correct Answer
Answer: a
Explanation: Round 1 has four step functions whereas Round 2 has three step functions.

91. For a key 25D5 and PT input A479 what is the output we obtain after the “add round key”
function?
a) F34D
b) 81AC
c) 79DF
d) 327D
Correct Answer

Answer: b
Explanation: Simply apply XOR to the state matrix PT with the key matrix to obatain the
output which in this case is 81AC.

92. The output of the previous question, on passing through “nibble substitution” gets us the
output
a) 3267
b) 1344
c) 64C0
d) CA37
Correct Answer

Answer: c
Explanation: 81AC after passing through the “nibble substitution” round produces an output
64C0. A corresponding substitution is referred to in this step.

93. The output of the previous question on passing through the “shift row” step function gives
us the output
a) C046
b) 0C64
c) 64C0
d) 640C
Correct Answer

Answer: b
Explanation: 64C0 after passing through the “shift row” round produces an output 640C. A
one nibble shift is performed in the second row in this step.

94. The output of the previous question on passing through the “mix columns” step function
gives us the output
a) 3252
b) 3743
c) 3425
d) 3473
Correct Answer

Answer: d
Explanation: 64C0 after passing through the “mix columns” round produces an output 3473.
This is obtained by multiplying this matrix with the matrix 1441.
95. The inverse transformation matrix times the forward transformation matrix equals the
identity matrix.
a) True
b) False
Correct Answer

Answer: c
Explanation: The statement is true. The inverse transformation matrix times the forward
transformation matrix does equal the identity matrix.

96. Which of the following are true

i) In the AES key expansion algorithm, the function g() operates on w i+3
ii) Perform a one-byte right circular rotation on the argument 4-byte word
iii) The round constant follows the formula RC[j] = RC[j − 1]

a) i) ii)
b) ii) only
c) i) only
d) All
Correct Answer

Answer: c
Explanation: Only the first option is true. There is a left circular rotation in AES key
expansion. RC[j] = 2 × RC [j − 1] is the formula for the round constant.

97. How many round keys are generated in the AES algorithm?
a) 11
b) 10
c) 8
d) 12
Correct Answer

Answer: a
Explanation: 11 round keys are generated. One for each of the 10 rounds and one of the initial
permutations (Round 0).
advertisement

98. Which function can be used in AES multiplication

a) m(x)=x7+x4+x3
b) m(x)=x8+x4+x3+x+1
c) m(x)=x8+x3+x2+x+1
d) m(x)=x8+x5+x3+x
Correct Answer

Answer: b
Explanation: m(x)=x8+x4+x3+x+1 stands for 100011011 which is an irreducible polynomial.
Others are not irreducible polynomials.
99. AES uses a ____________ bit block size and a key size of __________ bits.
a) 128; 128 or 256
b) 64; 128 or 192
c) 256; 128, 192, or 256
d) 128; 128, 192, or 256
Correct Answer

Answer: d
Explanation: It uses a 128-bit block size and a key size of 128, 192, or 256 bits.

100. Like DES, AES also uses Feistel Structure.

a) True
b) False
Correct Answer

Answer: b
Explanation: AES does not use a Feistel structure. Instead, each full round consists of four
separate functions:
-byte substitution
-Permutation
-arithmetic operations over a finite field, and
-XOR with a key.

101. Which one of the following is not a cryptographic algorithm- JUPITER, Blowfish, RC6,
Rijndael and Serpent?
a) JUPITER
b) Blowfish
c) Serpent
d) Rijndael
Correct Answer

Answer: a
Explanation: JUPITER is not a cryptographic algorithm.

102. Which algorithm among- MARS, Blowfish, RC6, Rijndael and Serpent -was chosen as
the AES algorithm?
a) MARS
b) Blowfish
c) RC6
d) Rijndael
Correct Answer

Answer: a
Explanation: In October 2000 the Rijndael algorithm was selected as the winner and NIIST
officially announced that Rijndael has been chosen as Advanced Encryption Standard (AES)
in November 2001.

103. How many rounds does the AES-192 perform?

a) 10
b) 12
c) 14
d) 16
Correct Answer

Answer: b
Explanation: AES 192 performs 12 rounds.

104. How many rounds does the AES-256 perform?

a) 10
b) 12
c) 14
d) 16
Correct Answer

Answer: c
Explanation: AES 256 performs 14 rounds.

105. What is the expanded key size of AES-192?

a) 44 words
b) 60 words
c) 52 words
d) 36 words
Correct Answer

Answer: c
Explanation: AES-192 has an expanded key size of 52 words.

106. The 4×4 byte matrices in the AES algorithm are called
a) States
b) Words
c) Transitions
d) Permutations
Correct Answer

Answer: a
Explanation: The matrices are called states.

107. In AES the 4×4 bytes matrix key is transformed into a keys of size __________
a) 32 words
b) 64 words
c) 54 words
d) 44 words
Correct Answer

Answer: d
Explanation: In AES the 4×4 bytes matrix key is transformed into a keys of size 44 bytes.

108. For the AES-128 algorithm there are __________ similar 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
Correct Answer

Answer: b
Explanation: In the AES-128 there are 9 similar rounds and the last round is different.

109. Which of the 4 operations are false for each round in the AES algorithm
i) Substitute Bytes
ii) Shift Columns
iii) Mix Rows
iv) XOR Round Key

a) i) only
b) ii) iii) and iv)
c) ii) and iii)
d) only iv)
Correct Answer

Answer: b
Explanation: AES rounds involve substitute bytes, shift rows, mix columns and addition of
round key.

110. There is an addition of round key before the start of the AES round algorithms.
a) True
b) False
Correct Answer

Answer: a
Explanation: In AES the final round contains only three transformations, and there is an
initial single transformation (Add Round Key) before the first round which can be considered
Round 0. Each transformation takes 4×4 matrixes as input and produces a 4×4 matrix as
output.