What do you mean by second preimage resistance in the context of hash functions?
a. Except for few hash values H, it is difficult to find a message M such that the hash of M is H.
b. Given a message M1, it is difficult to find another message M2 such that the corresponding hash values are the same.
c. It is difficult to find two messages M1 and M2 such that their hash values are the same.
d. None of these.
Answers
Answered by
3
Answer:
d is the answer
may be none of these
Answered by
19
Answer:
B
Explanation:
Second Preimage Resistance (Weak Collision Resistance) Given input m 1, it should be hard to find another message m 2 such that hashing = hash(m 2) and that m 1 ≠ m 2.
Similar questions