What are two critical properties for a cryptographic hash function?

The ideal cryptographic hash function has four properties: it is quick to compute the hash value for any given message. it is infeasible to generate a message from its hash value. it is infeasible to modify a message without changing the hash value.