hash collision
termcryptography
When two different inputs produce the same hash output.
Every hash has collisions in theory, since it maps infinite inputs to finite outputs, but a secure one makes finding a useful pair computationally infeasible. When a hash's collision resistance breaks (as happened to MD5 and SHA-1), it is retired for security use.
Also known as: collision, hash collision, birthday attack