A cryptographically strong hash function exhibits two features: it is irreversible and it minimizes collisions. Irreversibility means that the original data cannot be reconstructed from its hash. Cf. encryption, which must be reversible (see write-only memory.) A collision occurs when two different sets of data generate the same hash.