Question

The second pre-image resistant property is

(a) It is computationally infeasible to find any pair (x, y) such that H(x) = H(y)

(b) For any given block x, it is computationally infeasible to find y not equal to x, with H(y) = H(x)

(c) For any given hash value h it is computationally infeasible to find y such that H(y) = h

(d) None of the mentioned

I had been asked this question in an online quiz.

I want to ask this question from Hash Functions Based on Cipher Block Chaining topic in chapter Other Public Key Cryptosystems and Cryptographic Hash Functions of Cryptograph & Network Security

Answer 1

Correct choice is (b) For any given block x, it is computationally infeasible to find y not equal to x, with H(y) = H(x)

For explanation I would say: The second pre-image property is defined by: For any given block x, it is computationally infeasible to find y not equal to x, with H(y) = H(x).