Highway to Hull: A new algorithm solving the matrix code equivalence problem

The matrix code equivalence (MCE) problem, which is an algorithmic problem in rank metric coding theory, is at the core of a few recent signature schemes such as MEDS and ALTEQ. Recent works by Narayanan, Qiao and Tang on the one hand and by Ran and Samardjiska on the other hand tackle specific instances of MCE. In this talk, I will introduce the MCE problem, give an overview of these existing algorithms, and present a new algorithm which deals with a much broader range of possible parameters of MCE while preserving a similar complexity. This is joint work with Alain Couvreur.