Relating code equivalence to other isomorphism problems

DOI10.1007/S10623-024-01542-3MaRDI QIDQ7009886zbMATH OpenFDO

Authors Huck Bennett, Kaung Myat Htay Win

Publication date 19 March 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-024-01542-3

zbMATH Keywords

code equivalencegraph isomorphismlattice isomorphismmatroidsreductions

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Relations with coding theory (11H71) Linear codes (general theory) (94B05)

Cites work

• 2-isomorphic graphs.
• A mass formula for unimodular lattices with no roots
• Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
• Classification algorithms for codes and designs
• Complexity and algorithms for computing Voronoi cells of lattices
• Deciding orthogonality in construction-A lattices
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• scientific article; zbMATH DE number 1224949 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3365295 (Why is no real title available?)
• Hull attacks on the lattice isomorphism problem
• Is code equivalence easy to decide?
• Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
• LESS is more: code-based signatures without syndromes
• On the complexity of approximating extremal determinants in matrices
• On the complexity of matroid isomorphism problem
• On the computational hardness of the code equivalence problem in cryptography
• On the lattice isomorphism problem
• The equivalence of linear codes implies semi-linear equivalence
• The hardness of code equivalence over F_q and its application to code-based cryptography

Cited in

(3)

• Testing isomorphism between tuples of subspaces
• A survey on code equivalence: the state-of-the-art and open questions
• On the security of two blind signatures from code equivalence problems

This page was built for publication: Relating code equivalence to other isomorphism problems

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