Collision resistance
id:
collision-resistance-205-18883691
title:
Collision resistance
text:
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). 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 o
brand slug:
wiki
category slug:
encyclopedia
description:
Property of cryptographic hash functions
original url:
https://en.wikipedia.org/wiki/Collision_resistance
date created:
2005-10-23T22:13:58Z
date modified:
2024-09-10T14:38:52Z
main entity:
{"identifier":"Q1779448","url":"https://www.wikidata.org/entity/Q1779448"}
image:
fields total:
13
integrity:
15