Monomial isomorphism for tensors and applications to code equivalence problems

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

Cites Work

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

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)