Hashing and Digital Signatures 1.4 Flashcards

1
Q

Hashes

A
  • Represent data as a short string of text, often referred to as a message digest or a digital fingerprint.
  • One way algorithm
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Use of Hashes

A

-Verify a downloaded document is the same as the original provides integrity.
- Creates a digital signature for authentication, non-repudiation, and integrity.

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

Collision

A
  • A hash algorithm will produce the same hash value from two different sets of data.
  • Different input should never create the same hash.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Hash functions

A
  • Take an input of any size
  • Creates a fixed size string
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

MD5 Collision Problem

A
  • A Hashing algorithm that was found in 1996
  • Caused a few collision problems
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Salting

A

The process of adding a random element to a value before performing a Hash.
- Add randomization to prevent identical values from being hashed into an identical hash.

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

Salting to Prevent Brute Force Attacks

A
  • Increases the complexity of the problem by making the precomputing process not replicable.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Verifying Downloaded Files Using Hashing

A
  • Hashes may be provided on the downloaded site.
  • A comparison is performed on the Hash of the downloaded file with the posted Hash value.
  • ???
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Hash for Password Storage

A
  • Storing the password as a Hash, with additional salted Hash.
  • Entered passwords are changed to Hashes and compared to the ones stored on the server.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Rainbow Tables

A
  • ## Precomputed tables or hash values associated with a password.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Hashes for Digital Signatures

A
  • A cryptographic implementation designed to demonstrate authenticity and identity associated with a message.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Application of Digital Signatures

A
  • Proves the sent message has not been changed.
  • Proves the source of the message.
  • Makes sure the signature isn’t fake.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Process for Creating a Digital Signature.

A
  • Message to be signed is Hashed.
  • Hash is encrypted using the sender’s private key.
  • The message is verified using the Sender’s public key.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly