Monomial isomorphism for tensors and applications to code equivalence problems
type: Item
instance of: scholarly article
title: Monomial isomorphism for tensors and applications to code equivalence problems
author: Giuseppe D'Alconzo
published in: Designs, Codes and Cryptography
publication date: 2024-06-28T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 15A69
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 7873233
zbMATH Keywords: code equivalence
zbMATH Keywords: sum-rank metric
zbMATH Keywords: rank metric
zbMATH Keywords: matrix code equivalence
zbMATH Keywords: tensor isomorphism
MaRDI profile type: MaRDI publication profile
cites work: LESS-FM: fine-tuning signatures from the code equivalence problem
cites work: On the computational hardness of the code equivalence problem in cryptography
cites work: CSI-FiSh: efficient isogeny based signatures through class group computations
cites work: Does co-NP have short interactive proofs ?
cites work: Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric
cites work: Take your MEDS: digital signatures from matrix code equivalence
cites work: SeaSign: compact isogeny signatures from class group actions
cites work: \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
cites work: SCALLOP: scaling the CSI-FiSh
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
cites work: General linear group action on tensors: a candidate for post-quantum cryptography
cites work: Hamming and simplex codes for the sum-rank metric
cites work: Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
cites work: Twisted linearized Reed-Solomon codes: a skew polynomial framework
cites work: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
cites work: Is code equivalence easy to decide?
cites work: The complexity of tensor rank
cites work: Finding the permutation between equivalent linear codes: the support splitting algorithm
cites work: The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
cites work: Practical post-quantum signature schemes from isomorphism problems of trilinear forms
DOI: 10.1007/S10623-024-01375-0
description: scientific article; zbMATH DE number 7873233