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
How To Pass SY0-601 Exam?CompTIA SY0-601 PDF dumps.High quality SY0-601 pdf and software. VALID exam to help you pass. |
 |
It is definitely D, the inputs have to be different.
“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 such that H(a) = H(b), and a ≠ b”
https://en.wikipedia.org/wiki/Collision_resistance
Why is it A and not D ?
How can you find 2 identical messages with different hashes ? Then the hash is randomly generated and can never be verified, right ? I hope this question was not on the test.