Equivalent matrices up to permutations

arXiv1805.08343MaRDI QIDQ6301919FDOQ6301919

Authors: Stefan O. Tohǎneanu, Jesus Vargas 

Publication date: 21 May 2018

Abstract: Given two $kimesn$ matrices $A$ and $B$, we describe a couple of methods to solve the matrix equation $XA=BY$, where $X$ is an invertible $kimesk$ matrix, and $Y$ is an $nimesn$ permutation matrix, both of which we want to determine. We are interested in pursuing those techniques that have algebraic geometric flavor. An application to solving such a matrix equation comes from the cryptanalysis of McEliece cryptosystem. By using codewords of minimum weight of a linear code, in concordance with these methods of solving $XA=BY$, we present an efficient way to determine the entire encryption keys for the McEliece cryptosystems built on Reed-Solomon codes.

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

This page was built for publication: Equivalent matrices up to permutations

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