Chapter 7: PKI and Cryptographic Applications Flashcards

1
Q

_______ key cryptosystems assign each user a pair of keys: a public key and a private key.

A

Public

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

y2 = x3 + ax + b

A

elliptic curve formula

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

An approach to key exchange that allows two individuals to generate a shared secret key over an insecure communications channel

A

Diffie–Hellman algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

produces a 256-bit message digest using a 512-bit block size

A

SHA-256

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

uses a truncated version of the SHA-256 hash that drops 32 bits to produce a 224-bit message digest using a 512-bit block size.

A

SHA-224

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

produces a 512-bit message digest using a 1,024-bit block size

A

SHA-512

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

uses a truncated version of the SHA-512 hash that drops 128 bits to produce a 384-bit digest using a 1,024-bit block size.

A

SHA-384

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

a partial digital signature—it guarantees the integrity of a message during transmission, but it does not provide for nonrepudiation.

A

hashed message authentication code (HMAC)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

These neutral organizations offer notarization services for digital certificates.

A

Certificate authorities (CAs)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

counting the number of times each letter appears in the ciphertext

A

frequency analysis

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

the attacker has a copy of the encrypted message along with the plaintext message used to generate the ciphertext (the copy)

A

Known Plaintext

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

the attacker obtains the ciphertexts corresponding to a set of plaintexts of their own choosing

A

Chosen Plaintext

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

the attacker has the ability to decrypt chosen portions of the ciphertext message and use the decrypted portion of the message to discover the key

A

Chosen Ciphertext

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Attackers might use a _______ attack to defeat encryption algorithms that use two rounds of encryption.

A

meet-in-the-middle

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

a malicious individual sits between two communicating parties and intercepts all communications (including the setup of the cryptographic session)

A

Man in the Middle

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

also known as a collision attack or reverse hash matching seeks to find flaws in the one-to-one nature of hashing functions

A
17
Q

used against cryptographic algorithms that don’t incorporate temporal protections. In this attack, the malicious individual intercepts an encrypted message between two parties (often a request for authentication) and then later “replays” the captured message to open a new session.

A

replay attack