Skip to Main content Skip to Navigation
Conference papers

Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes

Pierre-Alain Fouque 1, 2, 3 Gaëtan Leurent 3
2 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : At the ECRYPT Hash Workshop 2007, Finiasz, Gaborit, and Sendrier proposed an improved version of a previous provably secure syndrome-based hash function. The main innovation of the new design is the use of a quasi-cyclic code in order to have a shorter description and to lower the memory usage. In this paper, we look at the security implications of using a quasi-cyclic code. We show that this very rich structure can be used to build a highly efficient attack: with most parameters, our collision attack is faster than the compression function!
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Pierre-Alain Fouque <>
Submitted on : Monday, January 17, 2011 - 3:38:15 PM
Last modification on : Thursday, July 1, 2021 - 5:58:06 PM
Long-term archiving on: : Tuesday, November 6, 2012 - 11:37:57 AM


Files produced by the author(s)




Pierre-Alain Fouque, Gaëtan Leurent. Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes. Topics in Cryptology - CT-RSA 2008, The Cryptographers' Track at the RSA Conference 2008, 2008, San Francisco, United States. pp.19-35, ⟨10.1007/978-3-540-79263-5_2⟩. ⟨inria-00556689⟩



Record views


Files downloads