Week 1 - Cryptographic Hash Functions

Question 1

What is are Cryptographic Primitives?

Answer 1

low-level constructs used to build large cryptographic protocols,

Question 2

What is a Cryptographic Hash Function?

Answer 2

Takes data of any length but produces a fixed length output of alphanumeric values (hash value)

e.g
Hello = 73GFW
World = 45AED

Question 3

What is a deterministic cryptographic hash?

properties of a cryptographic hash function

Answer 3

Deterministic - same input always produces the same hash value when the same hash function is used.

Question 4

What is pre-image resistance in cryptographic hashes?

properties of a cryptographic hash function

Answer 4

Pre-image resistance - impossible to determine original input from hash value

Question 5

What is second pre-image resistance in cryptographic hashes?

properties of a cryptographic hash function

Answer 5

impossible to find a different input that produces the same hash value with a Given Input

Question 6

What is collision-resistant resistance in cryptographic hashes?

properties of a cryptographic hash function

Answer 6

impossible to find two different inputs that produce the same hash value.

Question 7

What is the purpose of cryptographic hash functions?

Answer 7

to verify integrity

e.g
checking a downloaded file’s hash value against a trusted source ensures the file hasn’t been tampered with.

Question 8

What are two limitations of cryptographic hash functions?

Answer 8

1. Very small or predictable message cannot be eaningfully hashed
2. The origin of the hash function must be trusted to ensure integrity.