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