Collision resistance ($m\ne m^{\prime },H(m)=H(m^{\prime })$)

Collision resistance is a property of cryptographic hash functions that ensures it is computationally infeasible to find two distinct inputs that produce the same hash output. In other words, for a hash function \( h \), it should be hard to find inputs \( x \) and \( y \) (where \( x \neq y \)) such that \( h(x) = h(y) \).