Not enough less: an improved algorithm for solving code equivalence problems over F_q

DOI10.1007/978-3-030-81652-0_15MaRDI QIDQ832357zbMATH OpenOpenAlexFDO

Authors Ward Beullens

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-81652-0_15

zbMATH Keywords

code-based cryptographypost-quantum cryptographylinear code equivalence problempermutation code equivalence problem

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
• Code equivalence characterizes finite Frobenius rings
• On the computational hardness of the code equivalence problem in cryptography
• On the equivalence of codes over finite rings
• scientific article; zbMATH DE number 7180116
• On the equivalence of cyclic and quasi-cyclic codes over finite fields
• A note on a result in the theory of code construction
• Finite non-codes revisited from algorithmic points of view
• On codes over \(\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}\)
• Nonequivalent q-Ary Perfect Codes

Cites work

• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• A new identification scheme based on syndrome decoding
• A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
• Computing automorphism groups of error-correcting codes
• Durandal: a rank metric based signature scheme
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Improved identification schemes based on error-correcting codes
• Parallel collision search with cryptanalytic applications
• The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
• The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
• Wave: a new family of trapdoor one-way preimage sampleable functions based on codes

Cited in

(14)

• MR-DSS -- smaller MinRank-based (ring-)signatures
• On the computational hardness of the code equivalence problem in cryptography
• LESS-FM: fine-tuning signatures from the code equivalence problem
• Hull attacks on the lattice isomorphism problem
• An attack on a non-interactive key exchange from code equivalence
• Algebraic algorithm for the alternating trilinear form equivalence problem
• Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
• Graph-theoretic algorithms for the alternating trilinear form equivalence problem
• Take your MEDS: digital signatures from matrix code equivalence
• The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
• A new formulation of the linear equivalence problem and shorter less signatures
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• Hardness estimates of the code equivalence problem in the rank metric
• PERK: compact signature scheme based on a new variant of the permuted kernel problem

Describes a project that uses

Uses Software

• McEliece
• Durandal

This page was built for publication: Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)

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