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 hash between two specific messages
D. Find a common hash between a specific message and a random message
I am studying for Security+ and I find this question repeated with the same answer: A without explanation which I believe wrong.
I thought pre-image resistance is when given a hash output h, it is difficult to find the input m such that h(m) is irreversible.
While a weak collision test is when given a specific m1, it is difficult to find a random m2 such that h(m1) = h(m2)
And a strong collision test is when given a random m1 and a random m2, it is difficult to output the same hash digest such that h(m1) = h(m2)
So I believe the answer is not even listed. Since that A does not correspond to any of the collision tests definitions and B is typically the characteristic of a hash function, C implies identical messages which also a paraphrase of B and lastly, D closely refers to a weak collision test a specific m1 and random m2.
How could possibly the answer be A? Is this question missing something or am I misguided somehow? Can someone explain to me please.
I believe the answer should be E. Find a common hash between two random messages