Progress in Cryptology – Mycrypt 2005

DOI10.1007/11554868zbMath1126.94320OpenAlexW2496916788MaRDI 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

zbMATH Keywords

NP-completenessprovable securitycryptographic hash functionssyndrome decodingWagner's generalized birthday problem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (20)

A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes ⋮ Cryptanalysis of Grindahl ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ Short signatures from regular syndrome decoding in the head ⋮ Syndrome decoding in the head: shorter signatures from zero-knowledge proofs ⋮ Oblivious transfer with constant computational overhead ⋮ Collision attack on \({\mathtt Grindahl}\) ⋮ Efficient code-based fully dynamic group signature scheme ⋮ The extended \(k\)-tree algorithm ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Syndrome Based Collision Resistant Hashing ⋮ Analysis of Multivariate Hash Functions ⋮ Faster 2-Regular Information-Set Decoding ⋮ Really Fast Syndrome-Based Hashing ⋮ Interpreting Hash Function Security Proofs ⋮ Linearization Attacks Against Syndrome Based Hashes ⋮ Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes ⋮ Statistical Decoding of Codes over $\mathbb{F}_q$ ⋮ New code-based cryptographic accumulator and fully dynamic group signature ⋮ Unnamed Item

This page was built for publication: Progress in Cryptology – Mycrypt 2005