Difference between revisions of "Collision resistance"

From Computer Science Wiki
Jump to navigation Jump to search
Line 3: Line 3:
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]]


== References ==
== References ==

Revision as of 18:06, 8 March 2020

Advanced programming[1]

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]

Collision-Resistance-depicted-Friedl-2005.png

References