A Family of Fast Syndrome Based Cryptographic Hash Functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

A Family of Fast Syndrome Based Cryptographic Hash Functions

Daniel Augot
  • Function : Author
  • PersonId : 833459
Nicolas Sendrier


Recently, some collisions have been exposed for a variety of cryptographic hash functions 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 based on Wagner's generalized birthday algorithm 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 or a shorter description for the function.
Fichier principal
Vignette du fichier
RR-5592.pdf (532.24 Ko) Télécharger le fichier

Dates and versions

inria-00070414 , version 1 (19-05-2006)


  • HAL Id : inria-00070414 , version 1


Daniel Augot, Matthieu Finiasz, Nicolas Sendrier. A Family of Fast Syndrome Based Cryptographic Hash Functions. [Research Report] RR-5592, INRIA. 2005, pp.18. ⟨inria-00070414⟩
118 View
345 Download


Gmail Facebook Twitter LinkedIn More