Ch 6 Flashcards

1
Q
  1. How many possible keys exist in a 4-bit key space?

A. 4
B. 8
C. 16
D. 128

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
  1. John recently received an email message from Bill. What cryptographic goal would need to be met to convince John that Bill was actually the sender of the message?

A. Nonrepudiation
B. Confidentiality
C. Availability
D. Integrity

A

Answer: A

Nonrepudiation prevents the sender of a message from later denying that they sent it.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
  1. What is the length of the cryptographic key used in the Data Encryption Standard (DES) cryptosystem?

A. 56 bits
B. 128 bits
C. 192 bits
D. 256 bits

A

Answer: A

DES uses a 56-bit key. This is considered one of the major weaknesses of this cryptosystem.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
  1. What type of cipher relies on changing the location of characters within a message to achieve confidentiality?

A. Stream cipher
B. Transposition cipher
C. Block cipher
D. Substitution cipher

A

Answer: B

Transposition ciphers use a variety of techniques to reorder the characters within a message.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q
  1. Which one of the following is not a possible key length for the Advanced Encryption Standard Rijndael cipher?

A. 56 bits
B. 128 bits
C. 192 bits
D. 256 bits

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q
  1. Which one of the following cannot be achieved by a secret key cryptosystem?

A. Nonrepudiation
B. Confidentiality
C. Availability
D. Key distribution

A

Answer: A

Nonrepudiation requires the use of a public key cryptosystem to prevent users from falsely denying that they originated a message.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q
  1. When correctly implemented, what is the only cryptosystem known to be unbreakable?

A. Transposition cipher
B. Substitution cipher
C. Advanced Encryption Standard
D. One-time pad

A

Answer: D

Assuming that it is used properly, the one-time pad is the only known cryptosystem that is not vulnerable to attacks.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
  1. What is the output value of the mathematical function 16 mod 3?

A. 0
B. 1
C. 3
D. 5

A

Answer: B

Option B is correct because 16 divided by 3 equals 5, with a remainder value of 1.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
  1. In the 1940s, a team of cryptanalysts from the United States successfully broke a Soviet code based on a one-time pad in a project known as VENONA. What rule did the Soviets break that caused this failure?

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.

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
  1. Which one of the following cipher types operates on large pieces of a message rather than individual characters or bits of a message?

A. Stream cipher
B. Caesar cipher
C. Block cipher
D. ROT3 cipher

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
  1. What is the minimum number of cryptographic keys required for secure two-way communications in symmetric key cryptography?

A. One
B. Two
C. Three
D. Four

A

Answer: A

Symmetric key cryptography uses a shared secret key. All communicating parties utilize the same key for communication in any direction.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q
  1. Dave is developing a key escrow system that requires multiple people to retrieve a key but does not depend on every participant being present. What type of technique is he using?

A. Split knowledge
B. M of N Control
C. Work function
D. Zero-knowledge proof

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q
  1. Which one of the following Data Encryption Standard (DES) operating modes can be used for large messages with the assurance that an error early in the encryption/decryption process won’t spoil results throughout the communication?

A. Cipher Block Chaining (CBC)
B. Electronic Codebook (ECB)
C. Cipher Feedback (CFB)
D. Output Feedback (OFB)

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q
  1. Many cryptographic algorithms rely on the difficulty of factoring the product of large prime numbers. What characteristic of this problem are they relying on?

A. It contains diffusion.
B. It contains confusion.
C. It is a one-way function.
D. It complies with Kerchoff’s principle.

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q
  1. How many keys are required to fully implement a symmetric algorithm with 10 participants?

A. 10
B. 20
C. 45
D. 100

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
  1. What block size is used by the Advanced Encryption Standard?

A. 32 bits
B. 64 bits
C. 128 bits
D. Variable

A

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.

17
Q
  1. What kind of attack makes the Caesar cipher virtually unusable?

A. Meet-in-the-middle attack
B. Escrow attack
C. Frequency analysis attack
D. Transposition attack

A

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.

18
Q
  1. What type of cryptosystem commonly makes use of a passage from a well-known book for the encryption key?

A. Vernam cipher
B. Running key cipher
C. Skipjack cipher
D. Twofish cipher

A

Answer: B

Running key (or “book”) ciphers often use a passage from a commonly available book as the encryption key.

19
Q
  1. Which AES finalist makes use of prewhitening and postwhitening techniques?

A. Rijndael
B. Twofish
C. Blowfish
D. Skipjack

A

Answer: B

The Twofish algorithm, developed by Bruce Schneier, uses prewhitening and postwhitening.

20
Q
  1. How many encryption keys are required to fully implement an asymmetric algorithm with 10 participants?

A. 10
B. 20
C. 45
D. 100

A

Answer: B

In an asymmetric algorithm, each participant requires two keys: a public key and a private key.