Cryptanalysis of a Hash Function Based on Quasi-Cyclic Codes
| Citations: | 1 - 0 self |
BibTeX
@MISC{Fouque_cryptanalysisof,
author = {Pierre-alain Fouque and Gaëtan Leurent and École Normale Supérieure Département},
title = {Cryptanalysis of a Hash Function Based on Quasi-Cyclic Codes},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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! Key words: hash function, provable security, cryptanalysis, quasi-cyclic code, syndrome decoding. 1
Citations
| 69 | D.: A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost - Bellare, Micciancio - 1997 |
| 64 | A Generalized Birthday Problem - Wagner |
| 19 | Improved fast syndrome based cryptographic hash functions - Finiasz, Gaborit, et al. |
| 10 | Cryptanalysis of a provably secure cryptographic hash function. Cryptology ePrint Archive - Coron, Joux - 2004 |
| 3 | Linearization attacks against syndrome based hashes - Saarinen - 2007 |
