Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes

DOI10.1007/978-3-540-79263-5_2zbMath1159.94360OpenAlexW1536929968MaRDI QIDQ5458930

Pierre-Alain Fouque, Gaëtan Leurent

Publication date: 24 April 2008

Published in: Topics in Cryptology – CT-RSA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79263-5_2

zbMATH Keywords

cryptanalysisprovable securityhash functionquasi-cyclic codesyndrome decoding

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes ⋮ Syndrome Based Collision Resistant Hashing ⋮ Really Fast Syndrome-Based Hashing

Cites Work

• Unnamed Item
• How to Break MD5 and Other Hash Functions
• Finding Collisions in the Full SHA-1
• Linearization Attacks Against Syndrome Based Hashes
• Progress in Cryptology – Mycrypt 2005
• Some results on quasi-cyclic codes
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions

This page was built for publication: Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes