ExamGecko
Question list
Search
Search

Related questions











Question 86 - 212-81 discussion

Report
Export

Collision resistance is an important property for any hashing algorithm. Joan wants to find a cryptographic hash that has strong collision resistance. Which one of the following is the most collisionresistant?

A.
SHA2
Answers
A.
SHA2
B.
MD5
Answers
B.
MD5
C.
MD4
Answers
C.
MD4
D.
PIKE
Answers
D.
PIKE
Suggested answer: A

Explanation:

SHA2

https://en.wikipedia.org/wiki/Collision_resistance

Collision resistance is a property of cryptographic hash functions: a hash function H is collision-resistant if it is hard to find two inputs that hash to the same output; that is, two inputs a and b where a b but H(a) = H(b). The pigeonhole principle means that any hash function with more inputs than outputs will necessarily have such collisions; the harder they are to find, the more cryptographically secure the hash function is.

Due to the Birthday Problem, for a hash function that produces an output of length n bits, the probability of getting a collision is 1/2^n/2.

So, just looking for a hash function with larger 'n'.

The SHA-2 family consists of six hash functions with digests (hash values) that are 224, 256, 384 or 512 bits: SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256.

asked 18/09/2024
John Doe
36 questions
User
Your answer:
0 comments
Sorted by

Leave a comment first