Progress in Cryptology – Mycrypt 2005
From MaRDI portal
Publication:5491471
DOI10.1007/11554868zbMath1126.94320MaRDI QIDQ5491471
Matthieu Finiasz, Daniel Augot, Nicolas Sendrier
Publication date: 5 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11554868
NP-completeness; provable security; cryptographic hash functions; syndrome decoding; Wagner's generalized birthday problem
94A60: Cryptography
Related Items
Unnamed Item, Interpreting Hash Function Security Proofs, A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes, Analysis of Multivariate Hash Functions, Linearization Attacks Against Syndrome Based Hashes, Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes, Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, The extended \(k\)-tree algorithm, Collision attack on \({\mathtt Grindahl}\), New code-based cryptographic accumulator and fully dynamic group signature, Computational aspects of retrieving a representation of an algebraic geometry code, Faster 2-Regular Information-Set Decoding, Really Fast Syndrome-Based Hashing, Statistical Decoding of Codes over $\mathbb{F}_q$, Cryptanalysis of Grindahl, Syndrome Based Collision Resistant Hashing
