A security analysis of restricted syndrome decoding problems

DOI10.62056/A06CY7QIUMaRDI QIDQ7326400zbMATH OpenFDO

Authors Ward Beullens, Pierre Briaud, Morten Øygarden

Publication date 9 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/A06CY7QIU

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
• A new approach based on quadratic forms to attack the McEliece cryptosystem
• A new efficient algorithm for computing Gröbner bases (F₄)
• A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• Hybrid approach for solving multivariate systems over finite fields
• Parallel collision search with cryptanalytic applications
• Preliminary cryptanalysis of the Biscuit signature scheme
• Solving degree, last fall degree, and related invariants
• The Magma algebra system. I: The user language
• Zero knowledge protocols and signatures from the restricted syndrome decoding problem

This page was built for publication: A security analysis of restricted syndrome decoding problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326400)