What term describes the situation where two different files compute to the same hash value?

The term that describes the situation where two different files compute to the same hash value is a collision. In cryptography, a hash function is designed to produce a unique output for a unique input. However, due to the finite nature of hash values (for example, a hash value being a fixed length), it is mathematically possible for two distinct inputs to produce the same output. This occurrence is known as a collision.

Collisions can pose significant security risks because they undermine the integrity guarantee that hash functions provide. If an attacker can generate a different file that produces the same hash as a legitimate file, they might be able to substitute the malicious file without detection. This is particularly concerning in contexts such as digital signatures, where the identity and authenticity of a document are validated through its hash.

The other terms do not accurately describe this concept in the context of hashing. A breach refers to unauthorized access to data, an anomaly signifies an irregularity that may not necessarily pertain to hashing, and duplication indicates exact copies of files rather than two separate files sharing the same hash value.