Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CyberSecurity > Chapter 7 PKI and Cryptographic Applications > Flashcards

Chapter 7 PKI and Cryptographic Applications Flashcards

1
Q

disadvantage—the algorithm doubles the length of any message it encrypts.

A

El Gamal

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

SHA-1 produces a ____-bit message digest.

and processes a message in ___-bit blocks.

A

160 , 512

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

SHA-256 produces a ___-bit message digest using a ___-bit block size.

A

256, 512

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

SHA-224 uses a truncated version of the SHA-256 hash to produce a __-bit message digest using a ___-bit block size.

A

224, 512

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

SHA-512 produces a ___-bit message digest using a ____-bit block size.

A

512, 1024

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

SHA-384 uses a truncated version of the SHA-512 hash to produce a ___-bit digest
using a ____-bit block size.

A

384 , 1024

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

MD2 pads the message so that its length is a multiple of __ bytes

A

16

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

MD2 generates a ___-bit message.

A

128

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

______ computes a 16-byte checksum and appends it to the end of the message.

A

MD2

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

__ pads the message to ensure that the message length is 64 bits smaller than a multiple of 512 bits.

A

MD4 , MD5

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

MD4 algorithm then processes ___-bit blocks of the message in three rounds of computation. The final output is a ____-bit message digest.

A

512, 128

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

Difference between MD4 and MD5 is that MD4 uses 3 rounds MD5 uses rounds.

A

true

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

Digital Signature Standard consists of which encryption algorithms ?

A

The Digital Signature Algorithm (DSA)

The Rivest, Shamir, Adleman (RSA)

The Elliptic Curve DSA (ECDSA)

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

Steganographic algorithms work by making alterations to the _____ significant bits of the many bits that make up image files.

A

least

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

protects entire communications circuits by creating a secure tunnel between two points using either a hardware solution or a software solution that encrypts all traffic entering one end of the tunnel and decrypts all traffic entering the other end of the tunnel.

End-to-end encryption
Link encryption

A

Link encryption

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

does not encrypt the header, trailer, address, and routing data, so it moves faster from point to point but is more susceptible to sniffers and eavesdroppers.

End-to-end encryption
Link encryption

A

End-to-end encryption

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

IPsec relies on security associations, and

there are two main components:

A

The Authentication Header (AH

The Encapsulating Security Payload (ESP)

18
Q

IPsec provides for two discrete modes of operation _____ and _________

A

transport mode and tunnel mode

19
Q

_____ mode , the entire packet, including the header, is encrypted.

A

tunnel mode

20
Q

only the packet payload is encrypted.

A

transport mode

21
Q

When encryption happens at the higher OSI layers, it is usually ______ encryption,

A

end-to-end

22
Q

if encryption is done at the lower layers of the OSI model, it is usually ____ encryption

A

link

23
Q

The attacker responds to the originator’s initialization requests and sets up a
secure session with the originator. The attacker then establishes a second secure session with the
intended recipient using a different key and posing as the originator.

Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

Replay

A

Man in the Middle

24
Q

the attacker uses a known plaintext message. The
plain text is then encrypted using every possible key (k1), and the equivalent ciphertext is decrypted using all possible keys (k2). When a match is found, the corresponding pair (k1,
k2) represents both portions of the double encryption

Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

Replay

A

Meet in the Middle

25
Q

the attacker has the ability to encrypt plaintext messages of their choosing and can then analyze the ciphertext output of the encryption algorithm.

Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

Replay

A

Chosen Plaintext

26
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.

Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

Replay

A

Chosen Ciphertext

27
Q

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

Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

Replay

A

Known Plaintext

28
Q

counting the number of times each letter appears in the ciphertext.

Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

A

Frequency Analysis and the Ciphertext Only Attack

29
Q

attempts every possible valid combination for a key or password. They involve using massive amounts of processing power to methodically guess the key used to secure cryptographic
communications

Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

A

Brute Force

30
Q

attempt to find a vulnerability in the hardware or operating system hosting the cryptography application

Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

A

Statistical Attack

31
Q

focuses on exploiting the software code, not just errors and flaws but the methodology employed to program the encryption system.Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

A

Implementation Attack

32
Q

algebraic manipulation that attempts to reduce the complexity of the algorithm and focuses on the logic of the algorithm itself

Analytic Attack

Implementation Attack

Statistical Attack

Brute Force

Frequency Analysis and the Ciphertext Only Attack

Known Plaintext

Chosen Ciphertext

Chosen Plaintext

Meet in the Middle

Man in the Middle

Replay

A

Analytic Attack

33
Q

Keys used within public key systems must be ____ than those used in private key systems to produce cryptosystems of equivalent strengths

A

longer

34
Q

Which algorithm has these steps:

  1. Choose two large prime numbers (approximately 200 digits each), labeled p and q.
  2. Compute the product of those two numbers: n = p * q.
A

RSA public key algorithm

35
Q

Name asymmetrical algorithms ( 3 )

A

Elliptic Curve
El Gamal
RSA

36
Q

According to RSA Security, there are five basic requirements for a cryptographic hash function:

A

The input can be of any length.

The output has a fixed length.

The hash function is relatively easy to compute for any input.

The hash function is one-way (meaning that it is extremely hard to determine the
input when provided with the output). One-way functions and their usefulness in
cryptography are described in Chapter 6.

The hash function is collision free (meaning that it is extremely hard to find two
messages that produce the same hash value).

37
Q

Which algorithm pads the message with

additional data until the length reaches the next highest multiple of 512.

A

SHA

38
Q

If Alice wants to digitally sign a message she’s sending to Bob,

Alice then encrypts only the message digest using ______

A

her private key

39
Q

If Alice wants to digitally sign a message she’s sending to Bob,

Bob decrypts the digital signature using ____ _______ .

A

Alice’s public key

40
Q

S/MIME uses the ____- encryption algorithm

A

RSA

41
Q

S/MIME relies on the use of __ for exchanging cryptographic keys.

A

X.509 certs

CyberSecurity (21 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions