Security of cryptographic hash functions: Difference between revisions

Revision as of 15:39, 28 January 2011

Revision as of 18:01, 28 January 2011

Line 57:

* [[Elliptic curve only hash|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 weakened assumptions and eventually a second pre-image attack was found.

* [[Fast Syndrome Based Hash|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]] - 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 [[Ideal lattice cryptography|ideal lattices]]s.

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

* [[Knapsack-based hash functions]] - A family of hash functions based on the [[Knapsack problem]].