Security of cryptographic hash functions: Difference between revisions

Revision as of 11:52, 10 January 2010

Revision as of 12:04, 10 January 2010

Line 51:

* [[Very smooth hash|VSH - Very Smooth Hash function]] - a provably secure collision-resistant hash function assuming the hardness of finding nontrivial modular square roots modulo composite number (this is assumed to be as hard as integer factorization).

* [[MuHASH]]

* [[Elliptic Curvecurve Onlyonly hash function|ECOH - Elliptic Curve Only hash function]] - based on the concept of Elliptic curves, Subset Sum Problem and summation of polynomials. The security proof of the collision resistance was based on weakend assumptions and eventually a second pre-image attack was found.

* [[Fast Syndromesyndrome-Basedbased hash function|FSB - Fast Syndrome-Based hash function]] - it can be proven that breaking FSB is at least as difficult as solving a certain NP-complete problem known as Regular Syndrome Decoding.

* [[SWIFFT hash function|SWIFFT]] - SWIFFT is based on the [[Fast fourier transform]] and is provably collision resistant, under a relatively mild assumption about the worst-case difficulty of finding short vectors in cyclic/ideal [[lattice|lattices]].

* [[Chaum, van Heijst, Pfitzmann hash function]] - A compression function where finding collisions is as hard as finding a [[discrete logarithm|discrete logarithm problem]] in a finite group <math>F_{2p+1}</math>.