An administrator is testing the collision resistance of different hashing algorithms. Which of the
following is the strongest collision resistance test?
A.
Find two identical messages with different hashes
B.
Find two identical messages with the same hash
C.
Find a common has between two specific messages
D.
Find a common hash between a specific message and a random message
Explanation:
Ummm, no.
The correct answer is “Find a common hash between two specific messages”. This is the correct answer because, unless the two messages are identical, a common hash between them defines a collision. Finding a common hash between different inputs is a failure of collision resistance.
Incorrect answers:
Two identical messages always produce the same hash, so that does not measure collision resistance.
A common hash between a specific message and a random message will nearly always produce a different hash, but it might randomly choose the same message, causing the common hash but not demonstrating collision resistance.
Two identical messages with different hashes indicates that the hash has been executed incorrectly. The same input should always result in the same hash. This indicates a defect in hash execution, but does not demonstrate a lack of collision resistance.
0
2
I thought it was D. Thanks for your description.
1
0