CRHF

From Wikipedia, the free encyclopedia

In cryptography, CRHF stands for Collision Resistant Hash Function. Also known as Collision Free Hashing Scheme. CRHF consists of a collection of functions {hs: {0, 1} *→0,1c} s \in \{0, 1\}. Such that given s and x it is easy to compute hs(x), but given a random s it is hard to find x \neq x' such that hs(x) = hs(x').

This can be characterised by the following two person game.

  1. Given s ( a binary string of length s) and hs().
  2. Find x and x' such that hs(x)= hs(x').

If x \neq x' then the adversary wins.

[edit] See also

  • Universal One-Way Hash Functions (UOWHF).
 This cryptography-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../c/r/h/CRHF_b031.html"