Revisiting Algebraic Attacks on MinRank and on the Rank Decoding Problem. (arXiv:2208.05471v1 [cs.CR])

The Rank Decoding problem (RD) is at the core of rank-based cryptography.
This problem can also be seen as a structured version of MinRank, which is
ubiquitous in multivariate cryptography. Recently, \cite{BBBGNRT20,BBCGPSTV20}
proposed attacks based on two new algebraic modelings, namely the MaxMinors
modeling which is specific to RD and the Support-Minors modeling which applies
to MinRank in general. Both improved significantly the complexity of algebraic
attacks on these two problems. In the case of RD and contrarily to what …

attacks problem