Sciweavers

MYCRYPT
2005
Springer

A Family of Fast Syndrome Based Cryptographic Hash Functions

13 years 9 months ago
A Family of Fast Syndrome Based Cryptographic Hash Functions
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using similar constructions can however still be considered secure. Nevertheless, this has drawn attention on the need for new hash function designs. In this article is presented a family of secure hash functions, whose security is directly related to the syndrome decoding problem from the theory of error-correcting codes. Taking into account the analysis by Coron and Joux [4] based on Wagner’s generalized birthday algorithm [19] we study the asymptotical security of our functions. We demonstrate that this attack is always exponential in terms of the length of the hash value. We also study the work-factor of this attack, along with other attacks from coding theory, for non asymptotic range, i.e. for practical values. Accordingly, we propose a few sets of parameters giving a good security and either a faster hashing o...
Daniel Augot, Matthieu Finiasz, Nicolas Sendrier
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where MYCRYPT
Authors Daniel Augot, Matthieu Finiasz, Nicolas Sendrier
Comments (0)