An improved algorithm for code equivalence

DOI10.1007/978-3-031-86599-2_3MaRDI QIDQ6969314zbMATH OpenFDO

Authors Julian Nowakowski

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-86599-2_3

zbMATH Keywords

canonical form functionscryptanalysislinear code equivalence problem

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cites work

• \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
• A new formulation of the linear equivalence problem and shorter less signatures
• Computing automorphism groups of error-correcting codes
• Counting abelian squares
• Does the dual-sieve attack on learning with errors even work?
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• LESS is more: code-based signatures without syndromes
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
• On the computational hardness of the code equivalence problem in cryptography
• Parallel collision search with cryptanalytic applications
• Rigorous foundations for dual attacks in coding theory
• Take your MEDS: digital signatures from matrix code equivalence
• The hardness of code equivalence over F_q and its application to code-based cryptography

This page was built for publication: An improved algorithm for code equivalence

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