Collision-resistant

In cryptography, collision resistance is a property of cryptographic hash functions: a hash function ''H'' is collision-resistant if it is hard to find two inputs that hash to the same output; that is, two inputs ''a'' and ''b'' where ''a'' ≠ ''b'' but ''H''(''a'') = ''H''(''b''). Goldwasser, S. and Bellare, M.br>"Lecture Notes on Cryptography"
. Summer course on cryptography, MIT, 1996-2001 The pigeonhole principle means that any hash function with more inputs than outputs will necessarily have such collisions; the harder they are to find, the more cryptographically secure the hash function is.

The "birthday paradox" places an upper bound on collision resistance: if a hash function produces ''N'' bits of output, an attacker who computes only 2^''N''/2 (or $\scriptstyle \sqrt$) hash operations on random input is likely to find two matching outputs. If there is an easier method to do this than brute-force attack, it is typically considered a flaw in the hash function.Pass, R
"Lecture 21: Collision-Resistant Hash Functions and General Digital Signature Scheme"
Course on Cryptography, Cornell University, 2009

Cryptographic hash functions are usually designed to be collision resistant. However, many hash functions that were once thought to be collision resistant were later broken. MD5 and SHA-1 in particular both have published techniques more efficient than brute force for finding collisions. However, some hash functions have a proof that finding collisions is at least as difficult as some hard mathematical problem (such as integer factorization or discrete logarithm). Those functions are called provably secure.

Definition

A family of functions generated by some algorithm ''G'' is a family of collision-resistant hash functions, if , ''m''(''k''), > , ''l''(''k''), for any ''k'', i.e., ''h''_''k'' compresses the input string, and every ''h''_''k'' can be computed within polynomial time given ''k'', but for any probabilistic polynomial algorithm ''A'', we have

: Pr [''k'' ← ''G''(1^''n''), (''x''₁, ''x''₂) ← ''A''(''k'', 1^''n'') s.t. ''x''₁ ≠ ''x''₂ but ''h''_''k''(''x''₁) = ''h''_''k''(''x''₂)] < negl(''n''),

where negl(·) denotes some negligible function, and ''n'' is the security parameter., def 1.

Weak and strong collision resistance

There are two different types of collision resistance.

A hash function has weak collision resistance when, given a hashing function H and an x, no other x' can be found such that H(x)=H(x'). In words, when given an x, it is not possible to find another x' such that the hashing function would create a collision.

A hash function has strong collision resistance when, given a hashing function H, no arbitrary x and x' can be found where H(x)=H(x'). In words, no two x's can be found where the hashing function would create a collision.

Rationale

Collision resistance is desirable for several reasons.
* In some digital signature systems, a party attests to a document by publishing a public key signature on a hash of the document. If it is possible to produce two documents with the same hash, an attacker could get a party to attest to one, and then claim that the party had attested to the other.
* In some distributed content systems, parties compare cryptographic hashes of files in order to make sure they have the same version. An attacker who could produce two files with the same hash could trick users into believing they had the same version of a file when they in fact did not.

See also

* Birthday attack
* Puzzle friendliness
* Collision attack
* Preimage attack
* NIST hash function competition
* Provably secure cryptographic hash function
* Error detection and correction

References

{{DEFAULTSORT:Collision Resistance
Symmetric-key cryptography
Theory of cryptography