Chapter 6: Hashing and Digital Signature Flashcards

1
Q

is a security method that scrambles a message into a fixed length string without the possibility of turning it back to its original form.

A

Hash(ing) or Message Digest

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

is also a basic component of digital signature.

A

Hash

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

is a one-way function that takes a message of arbitrary length as input and produces fixed-length bit string as output.

A

Hash Function

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

is the possibility of two different messages that would result to the same hash value.

A

Collision

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

is a concept under Probability theorem, that states that in a set of randomly chosen people, some pair of them will have the same birthday.

A

Birthday Paradox

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

this principle state that if a number of items are put into a set of containers, then at least one container will contain more than one item.

A

Pigeon Hole Principle

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

is a mathematical algorithm that maps data of arbitrary size (message) to a bit array of a fixed size.

A

Cryptographic Hash Function (CHF)

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

[3] Common Examples of Hash Algorithm

A
  1. Message Digest Algorithm (MD5)
  2. Secured Hash Algorithm 1 (SHA 1)
  3. Secured Hash Algorithm 2 (SHA 2
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

a hash function that produces 128-bit hash value for arbitrary length.

A

Message Digest Algorithm (MD5)

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

designed the Message Digest Algorithm.

A

Ronald Rivest (1991)

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

a cryptographic hash function which takes an input and produces 160-bit(20-byte) hash.

A

Secured Hash Algorithm 1 (SHA 1)

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

is a family that consists of six hash function with digests that are 224, 256, 384, or 512 bits.

A

Secured Hash Algorithm 2 (SHA 2)

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

[3] Application of Hash Functions

A
  • Password Protection
  • Checksum / Integrity Check
  • Digital Signature
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Desirable Properties of Hash Algorithm

A
  1. Randomness
  2. Avalanche Effect
  3. Strict Avalanche Criterion
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

[3] Tests perform to evaluate randomness

A

o Correlation Test

o Run Test

o Compute for the Mean and Variance and Independence of Probability

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

[2] Tests performed to evaluate Avalanche Effect

A

o Confusion Test
o Diffusion Test

17
Q

test the effect of the key to the ciphertext.

A

Confusion Test

18
Q

test the effect of the plaintext to the ciphertext.

A

Diffusion Test

19
Q

at least 50%-bit flip in the ciphertext per one bit flip in the input.

A

Strict Avalanche Criterion

20
Q

has the same authentication and legally binding function as handwritten signature.

A

Digital Signature

21
Q

[3] Advantages of Digital Signature

A
  • Authenticity (signed by real signatory)
  • Integrity (document is not altered)
  • Non-Repudiation
22
Q

[3] Major Components of a Digital Signature

A
  1. Digital Document / File
  2. Hash Algorithm
  3. Encryption Algorithm
23
Q

the file that is needed to be digitally signed.

A

Digital Document / File

24
Q

this is to ensure that the document is not altered.

A

Hash Algorithm -