# Difference between revisions of "Collision resistance"

Jump to navigation
Jump to search

Mr. MacKenty (talk | contribs) |
Mr. MacKenty (talk | contribs) |
||

Line 2: | Line 2: | ||

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 such that H(a) = H(b), and a ≠ b<ref>https://en.wikipedia.org/wiki/Collision_resistance</ref> | 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 such that H(a) = H(b), and a ≠ b<ref>https://en.wikipedia.org/wiki/Collision_resistance</ref> | ||

− | |||

− | |||

[[File:Collision-Resistance-depicted-Friedl-2005.png|600px]] | [[File:Collision-Resistance-depicted-Friedl-2005.png|600px]] |

## Latest revision as of 17:07, 8 March 2020

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 such that H(a) = H(b), and a ≠ b^{[2]}