Monomial isomorphism for tensors and applications to code equivalence problems

DOI10.1007/S10623-024-01375-0MaRDI QIDQ6564091zbMATH OpenFDO

Authors Giuseppe D'Alconzo

Publication date 28 June 2024

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-024-01375-0

zbMATH Keywords

code equivalencerank metricsum-rank metrictensor isomorphismmatrix code equivalence

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Linear codes (general theory) (94B05)

Recommendations

• Hardness estimates of the code equivalence problem in the rank metric
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• Monomial isomorphisms of cyclic codes
• Tensor representation of rank-metric codes
• Is code equivalence easy to decide?

Cites work

• CSI-FiSh: efficient isogeny based signatures through class group computations
• Does co-NP have short interactive proofs ?
• Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• General linear group action on tensors: a candidate for post-quantum cryptography
• Hamming and simplex codes for the sum-rank metric
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• Is code equivalence easy to decide?
• LESS-FM: fine-tuning signatures from the code equivalence problem
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• On the computational hardness of the code equivalence problem in cryptography
• Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric
• Practical post-quantum signature schemes from isomorphism problems of trilinear forms
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• SCALLOP: scaling the CSI-FiSh
• SeaSign: compact isogeny signatures from class group actions
• Take your MEDS: digital signatures from matrix code equivalence
• The complexity of tensor rank
• The hardness of code equivalence over F_q and its application to code-based cryptography
• Twisted linearized Reed-Solomon codes: a skew polynomial framework
• \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple

Cited in

(3)

• Hardness estimates of the code equivalence problem in the rank metric
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme

This page was built for publication: Monomial isomorphism for tensors and applications to code equivalence problems

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