Not enough less: an improved algorithm for solving code equivalence problems over F_q
DOI10.1007/978-3-030-81652-0_15zbMATH Open1485.94131OpenAlexW3186070374MaRDI QIDQ832357FDOQ832357
Authors: Ward Beullens 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_15
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
code-based cryptographypost-quantum cryptographylinear code equivalence problempermutation code equivalence problem
Cryptography (94A60) Linear codes (general theory) (94B05) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Parallel collision search with cryptanalytic applications
- The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
- A new identification scheme based on syndrome decoding
- Improved identification schemes based on error-correcting codes
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Durandal: a rank metric based signature scheme
- A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
- Computing automorphism groups of error-correcting codes
- The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
Cited In (14)
- Graph-theoretic algorithms for the alternating trilinear form equivalence problem
- Take your MEDS: digital signatures from matrix code equivalence
- LESS-FM: fine-tuning signatures from the code equivalence problem
- PERK: compact signature scheme based on a new variant of the permuted kernel problem
- 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
- MR-DSS -- smaller MinRank-based (ring-)signatures
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
- Hull attacks on the lattice isomorphism problem
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- An attack on a non-interactive key exchange from code equivalence
- On the computational hardness of the code equivalence problem in cryptography
- Algebraic algorithm for the alternating trilinear form equivalence problem
- Hardness estimates of the code equivalence problem in the rank metric
Uses Software
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)
