A. 4
B. 8
C. 16
D. 128
Answer: C
To determine the number of keys in a key space, raise 2 to the power of the number of bits in the key space. In this example, 24 = 16.
A. Nonrepudiation
B. Confidentiality
C. Availability
D. Integrity
Answer: A
Nonrepudiation prevents the sender of a message from later denying that they sent it.
A. 56 bits
B. 128 bits
C. 192 bits
D. 256 bits
Answer: A
DES uses a 56-bit key. This is considered one of the major weaknesses of this cryptosystem.
A. Stream cipher
B. Transposition cipher
C. Block cipher
D. Substitution cipher
Answer: B
Transposition ciphers use a variety of techniques to reorder the characters within a message.
A. 56 bits
B. 128 bits
C. 192 bits
D. 256 bits
Answer: A
The Rijndael cipher allows users to select a key length of 128, 192, or 256 bits, depending on the specific security requirements of the application
A. Nonrepudiation
B. Confidentiality
C. Availability
D. Key distribution
Answer: A
Nonrepudiation requires the use of a public key cryptosystem to prevent users from falsely denying that they originated a message.
A. Transposition cipher
B. Substitution cipher
C. Advanced Encryption Standard
D. One-time pad
Answer: D
Assuming that it is used properly, the one-time pad is the only known cryptosystem that is not vulnerable to attacks.
A. 0
B. 1
C. 3
D. 5
Answer: B
Option B is correct because 16 divided by 3 equals 5, with a remainder value of 1.
A. Key values must be random.
B. Key values must be the same length as the message.
C. Key values must be used only once.
D. Key values must be protected from physical disclosure.
Answer: A
The cryptanalysts from the United States discovered a pattern in the method the Soviets used to generate their one-time pads. After this pattern was discovered, much of the code was eventually broken.
A. Stream cipher
B. Caesar cipher
C. Block cipher
D. ROT3 cipher
Answer: C
Block ciphers operate on message “chunks” rather than on individual characters or bits. The other ciphers mentioned are all types of stream ciphers that operate on individual bits or characters of a message.
A. One
B. Two
C. Three
D. Four
Answer: A
Symmetric key cryptography uses a shared secret key. All communicating parties utilize the same key for communication in any direction.
A. Split knowledge
B. M of N Control
C. Work function
D. Zero-knowledge proof
Answer: B
M of N Control requires that a minimum number of agents (M) out of the total number of agents (N) work together to perform high-security tasks.
A. Cipher Block Chaining (CBC)
B. Electronic Codebook (ECB)
C. Cipher Feedback (CFB)
D. Output Feedback (OFB)
Answer: D
Output Feedback (OFB) mode prevents early errors from interfering with future encryption/decryption. Cipher Block Chaining and Cipher Feedback modes will carry errors throughout the entire encryption/decryption process. Electronic Codebook (ECB) operation is not suitable for large amounts of data.
A. It contains diffusion.
B. It contains confusion.
C. It is a one-way function.
D. It complies with Kerchoff’s principle.
Answer: C
A one-way function is a mathematical operation that easily produces output values for each possible combination of inputs but makes it impossible to retrieve the input values.
A. 10
B. 20
C. 45
D. 100
Answer: C
The number of keys required for a symmetric algorithm is dictated by the formula (n*(n–1))/2, which in this case, where n = 10, is 45.
A. 32 bits
B. 64 bits
C. 128 bits
D. Variable
Answer: C
The Advanced Encryption Standard uses a 128-bit block size, despite the fact that the Rijndael algorithm it is based on allows a variable block size.
A. Meet-in-the-middle attack
B. Escrow attack
C. Frequency analysis attack
D. Transposition attack
Answer: C
The Caesar cipher (and other simple substitution ciphers) are vulnerable to frequency analysis attacks that analyze the rate at which specific letters appear in the ciphertext.
A. Vernam cipher
B. Running key cipher
C. Skipjack cipher
D. Twofish cipher
Answer: B
Running key (or “book”) ciphers often use a passage from a commonly available book as the encryption key.
A. Rijndael
B. Twofish
C. Blowfish
D. Skipjack
Answer: B
The Twofish algorithm, developed by Bruce Schneier, uses prewhitening and postwhitening.
A. 10
B. 20
C. 45
D. 100
Answer: B
In an asymmetric algorithm, each participant requires two keys: a public key and a private key.