Cryptanalysis of a Hash Function Based on Quasi-cyclic CodesReport as inadecuate

Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes - Download this document for free, or read online. Document in PDF available to download.

1 LIENS - Laboratoire d-informatique de l-école normale supérieure 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 3 ENS Paris - École normale supérieure - Paris

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!

Author: Pierre-Alain Fouque - Gaëtan Leurent -



Related documents