Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes
From MaRDI portal
Publication:5458930
DOI10.1007/978-3-540-79263-5_2zbMATH Open1159.94360OpenAlexW1536929968MaRDI QIDQ5458930FDOQ5458930
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
Recommendations
- Cryptanalysis of one hash function based on quasigroup
- Cryptanalysis of a hash function based on isotopy of quasigroups
- scientific article; zbMATH DE number 1759316
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- scientific article; zbMATH DE number 1942817
- scientific article; zbMATH DE number 2160572
- Cryptanalysis of the HaF family of hash functions
- Cryptanalysis of hash functions with structures
- Cryptanalysis of the Tillich-Zémor hash function
- Cryptanalysis of a hash function, and the modular subset sum problem
Cites Work
- Title not available (Why is that?)
- Some results on quasi-cyclic codes
- Finding Collisions in the Full SHA-1
- How to Break MD5 and Other Hash Functions
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
- Progress in Cryptology – Mycrypt 2005
- Linearization Attacks Against Syndrome Based Hashes
Cited In (8)
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Provably Good Codes for Hash Function Design
- Progress in Cryptology – Mycrypt 2005
- A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes
- Cryptanalysis of the Quaternion Rainbow
- Really Fast Syndrome-Based Hashing
- Syndrome Based Collision Resistant Hashing
- Efficient Encryption From Random Quasi-Cyclic Codes
This page was built for publication: Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458930)
