Not enough less: an improved algorithm for solving code equivalence problems over F_q
From MaRDI portal
Publication:832357
Recommendations
- The hardness of code equivalence over 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
- 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
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- 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 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
(24)- LESS-FM: fine-tuning signatures from the code equivalence problem
- An attack on a non-interactive key exchange from code equivalence
- The hardness of code equivalence over F_q and its application to code-based cryptography
- Hull attacks on the lattice isomorphism problem
- On the computational hardness of the code equivalence problem in cryptography
- Hardness estimates of the code equivalence problem in the rank metric
- Take your MEDS: digital signatures from matrix code equivalence
- Graph-theoretic algorithms for the alternating trilinear form equivalence problem
- MR-DSS -- smaller MinRank-based (ring-)signatures
- Algebraic algorithm for the alternating trilinear form equivalence problem
- PERK: compact signature scheme based on a new variant of the permuted kernel problem
- 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
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- Highway to Hull: an algorithm for solving the general matrix code equivalence problem
- Hollow LWE: a new spin. Unbounded updatable encryption from LWE and PCE
- On linear equivalence, canonical forms, and digital signatures
- Rare structures in tensor graphs. Bermuda triangles for cryptosystems based on the tensor isomorphism problem
- Don't use it twice! Solving relaxed linear equivalence problems
- The code equivalence problem and its applications to cryptography
- An improved algorithm for code equivalence
- The matrix subcode equivalence problem and its application to signature with MPC-in-the-head
- A survey on code equivalence: the state-of-the-art and open questions
- Two is all it takes: asymptotic and concrete improvements for solving code equivalence
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)
