Monomial isomorphism for tensors and applications to code equivalence problems

Starting from the problem of d -tensor isomorphism ( d - TI TI ), we study the relation between various code equivalence problems in different metrics. In particular, we show a reduction from the sum-rank metric ( CEₛᵣ CE sr ) to the rank metric ( CEᵣₖ CE rk ). To obtain this result, we investigate reductions between tensor problems. We define the monomial isomorphism problem for d -tensors ( d - TI^* TI ∗ ), where, given two d -tensors, we ask if there are $$d-1$$ d - 1 invertible matrices and a monomial matrix sending one tensor into the other. We link this problem to the well-studied d - TI TI and the TI TI -completeness of d - TI^* TI ∗ is shown. Due to this result, we obtain a reduction from CEₛᵣ CE sr to CEᵣₖ CE rk . In the literature, a similar result was known, but it needs an additional assumption on the automorphisms of matrix codes. Since many constructions based on the hardness of Code Equivalence problems are emerging in cryptography, we analyze how such reductions can be taken into account in the design of cryptosystems based on CEₛᵣ CE sr .