hash collision


Also found in: Wikipedia.

hash collision

(programming)
(Or "hash clash") When two different keys hash to the same value, i.e. to the same location in a hash table.

ESR once asked a friend what he expected Berkeley to be like. The friend replied, "Well, I have this mental picture of naked women throwing Molotov cocktails, but I think that's just a collision in my hash tables."
References in periodicals archive ?
Double hashing is also used to avoid the hash collision with different set of value position on the test and training samples.
A, C, G, or T), which will dramatically mitigate the possibility of hash collision.
This attack is expected to find a hash collision i.
Such pair of messages is called a cryptographic hash collision.
However, the use of bit state hashing will reduce the accuracy of the outcome because a state could be mistakenly reported as visited due to a hash collision and is therefore not stored in the hash array.
While improbable, a hash collision is a real statistical risk.
HashDoS Defender - This iRule guards against hash collision "HashDoS" attacks through HTTP POST parameters.