HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A Family of Fast Syndrome Based Cryptographic Hash Functions

Abstract : 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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 8:25:09 PM
Last modification on : Thursday, February 3, 2022 - 11:13:48 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:09:39 PM


  • 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⟩



Record views


Files downloads