Revision as of 14:54, 10 January 2010 edit Joost Lambregts (talk \| contribs) 42 edits →Downsides of Provable Approach ← Previous edit		Revision as of 14:56, 10 January 2010 edit undo Joost Lambregts (talk \| contribs) 42 edits →More practical Provably Secure Hash Functions Next edit →
Line 52: * [[MuHASH]] * [[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 weakend assumptions and eventually a second pre-image attack was found. * [[Fast syndrome- based 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]] - 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>.

Security of cryptographic hash functions: Difference between revisions