Module 16 Flashcards

Basic Integrity and Authenticity

1
Q

Four elements of secure communications

A

Data Integrity
Origin Authentication
Data Confidentiality
Data Non-Repudiation

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

Data integrity

A

Guarantees that the message was not altered. Any changes to data in transit will be detected.

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

How is integrity ensured?

A

By implementing either of the Secure Hash Algorithms (SHA-2 or SHA-3)

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

Why should MD5 be avoided?

A

It is inherently insecure and creates vulnerabilities in a network

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

Origin Authentication

A

Guarantees that the message is not a forgery and does actually come from whom it states

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

How do most modern networks ensure authentication?

A

Hash-based message authentication code (HMAC)

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

Data Confidentiality

A

Guarantees that only authorized users can read the message. If the message is intercepted, it cannot be deciphered within a reasonable amount of time

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

How is Data confidentiality implemented?

A

Using symmetric and symmetric encryption algorithms

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

Data Non-Repudiation

A

Guarantees that the sender cannot repudiate, or refute, the validity of a message sent

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

What does Non-repudiation rely on?

A

The fact that only the sender has the unique characteristics or signature for how that message is treated

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

Cryptography can be used almost anywhere

A

True

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

Hashes

A

Used to verify and ensure data integrity and authentication

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

What is hashing based on?

A

One-way mathematical function that is relatively easy to compute, but harder to reverse

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

What is a resulting hash sometimes called?

A

Message digest
Digest
Digital fingerprint

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

What is not possible with hash functions?

A

Two different sets of data having the same hash output

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

When a message is altered, what happens to the hash?

A

The hash changes

17
Q

Cryptographic hash values (digital fingerprints) can be used to detect what?

A

Duplicate data files, file version changes, and similar applications

18
Q

How are cryptographic hash values used?

A

To guard against an accidental or intentional change to the data, or accidental data corruption

19
Q

What is h= H(x) used for?

A

To explain how a hash algorithm operates

20
Q

How is HMAC calculated?

A

Using any cryptographic algorithm that combines a cryptographic hash functions with a secret key

21
Q

MD5 with 128-bit digest

A

Legacy algorithm and should be avoided and used only when no better alternatives are available

22
Q

SHA-1 (NSA)

A

Creates a 160-bit hashed message and is slightly slower than MD5.
Has known flaws and is a legacy algorithm

23
Q

SHA-2 (NSA)

A

SHA-256, SHA-384, and SHA-512 algorithms should be used whenever possible

24
Q

SHA-3 (NIST)

A

Alternative and eventual replacement for the SHA-2 family of hashing algorithms
Next-gen algorithms and should be used whenever possible

25
Q

Where are most attacks aimed at in cryptosystems?

A

The key management level

26
Q

Key generation

A

Usually automated and not left to the end user
Ensures that the attacker cannot predict which keys are more likely to be used

27
Q

Key veification

A

Weak keys can be identified and regenerated to provide a more secure encryption

28
Q

Key exchange

A

Provides a secure key exchange mechanism that allows secure agreement on the keying material with the other party over an untrusted medium

29
Q

Key storage

A

Key can be stored in memory
This presents a possible problem when the memory is swapped to the disk because a Trojan horse program installed on the PC of a user could then have access to the private keys of that user

30
Q

Key lifetime

A

Using short key lifetimes improves the security of legacy ciphers that are used on high-speed connections

31
Q

Key revocation and destruction

A

Notifies all interested parties that a certain key has been compromised and should no longer be used. Destruction erases old keys in a manner that prevents malicious attackers from recovering them

32
Q
A