Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes
From MaRDI portal
Publication:5458930
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
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- Finding Collisions in the Full SHA-1
- How to Break MD5 and Other Hash Functions
- Linearization Attacks Against Syndrome Based Hashes
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
- Progress in Cryptology – Mycrypt 2005
- Some results on quasi-cyclic codes
Cited in
(9)- Efficient Encryption From Random Quasi-Cyclic Codes
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Provably Good Codes for Hash Function Design
- Progress in Cryptology – Mycrypt 2005
- Efficient software implementations of code-based hash functions and stream-ciphers
- Really fast syndrome-based hashing
- Cryptanalysis of the Quaternion Rainbow
- A digital signature scheme \(\text{mCFS}^{\text{QC-LDPC}}\) based on QC-LDPC codes
- Syndrome Based Collision Resistant Hashing
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)
