CRYPTO : Christophe Levrat – A new algorithm solving the matrix code equivalence problem
Bâtiment Fermat, salle 4205The matrix code equivalence problem consists, given two k-dimensional vector spaces C,D of m x n matrices over a finite field, in finding invertible matrices P and Q such that D=PCQ. Recent signature schemes such as MEDS and ALTEQ relate