Cryptography and Network Security MCQs - Unit 2
A
56 bits
B
128 bits
C
32 bits
D
64 bits
Correct Answer
64 bits
A
64 bits
B
56 bits
C
48 bits
D
128 bits
Correct Answer
56 bits
Correct Answer
16
A
64 bits
B
128 bits
C
256 bits
D
56 bits
Correct Answer
128 bits
A
56, 112 and 168 bits
B
64, 128 and 256 bits
C
128, 192 and 256 bits
D
40 to 2048 bits
Correct Answer
128, 192 and 256 bits
Correct Answer
10
A
SubBytes
B
Initial permutation
C
ShiftRows
D
AddRoundKey
Correct Answer
Initial permutation
A
64 bits
B
128 bits
C
56 bits
D
256 bits
Correct Answer
64 bits
A
56 to 128 bits
B
64 to 256 bits
C
128 to 512 bits
D
32 to 448 bits
Correct Answer
32 to 448 bits
A
all variable
B
all fixed
C
fixed except the key length
D
fixed except the block size
Correct Answer
all variable
A
56 bits
B
128 bits
C
64 bits
D
448 bits
Correct Answer
128 bits
A
56 bits
B
168 bits
C
112 bits
D
192 bits
Correct Answer
168 bits
A
identical plaintext blocks give identical ciphertext blocks
B
it needs an initialization vector
C
it is a stream cipher
D
it cannot decrypt in parallel
Correct Answer
identical plaintext blocks give identical ciphertext blocks
A
ECB
B
Hash mode
C
Signature mode
D
CBC
Correct Answer
CBC
A
CTR
B
ECB
C
CBC
D
Raw DES
Correct Answer
CTR
A
block cipher
B
stream cipher
C
hash function
D
public key cipher
Correct Answer
stream cipher
Correct Answer
256
A
computing discrete logarithms
B
solving the knapsack problem
C
factoring a large number into primes
D
finding hash collisions
Correct Answer
factoring a large number into primes
Correct Answer
33
Correct Answer
3
A
key exchange
B
digital signatures only
C
hashing
D
message compression
Correct Answer
key exchange
A
integer factorisation
B
the birthday paradox
C
the knapsack problem
D
the discrete logarithm problem
Correct Answer
the discrete logarithm problem
A
integer factorisation
B
matrix inversion
C
the discrete logarithm problem
D
stream generation
Correct Answer
the discrete logarithm problem
A
super-increasing sequence
B
Feistel network
C
S-box
D
hash chain
Correct Answer
super-increasing sequence
A
AES
B
DES
C
Blowfish
D
Triple DES
Correct Answer
AES
Fill in the Blanks
26
DES performs ______ rounds of processing.
Correct Answer
16
27
The DES key is 64 bits long including ______ parity bits.
Correct Answer
8
28
The AES state is a ______ matrix of bytes.
Correct Answer
4 × 4
29
AES with a 256-bit key uses ______ rounds.
Correct Answer
14
30
Triple DES with three different keys has an effective key length of ______ bits.
Correct Answer
168
31
In ______ mode, each plaintext block is XORed with the previous ciphertext block before encryption.
Correct Answer
CBC (Cipher Block Chaining)
32
Blowfish uses a ______-round Feistel network.
Correct Answer
16
33
RC4 is a ______ cipher.
Correct Answer
stream
34
In RSA, φ(n) = ______.
Correct Answer
(p − 1)(q − 1)
35
In RSA with p = 5 and q = 7, the value of φ(n) is ______.
Correct Answer
24
36
In Diffie-Hellman with q = 23, α = 5, XA = 6 and XB = 15, the shared secret key is ______.
Correct Answer
2
37
An ElGamal ciphertext consists of ______ values (C1, C2).
Correct Answer
two
38
A sequence in which each element is greater than the sum of all previous elements is called a ______ sequence.
Correct Answer
super-increasing
39
The IDEA cipher uses a ______-bit key.
Correct Answer
128
40
The attack in which an attacker intercepts and relays Diffie-Hellman public values is the ______ attack.
Correct Answer
man-in-the-middle