Which property of a cryptographic hash function ensures that finding two different inputs that produce the same hash output is computationally infeasible?
