Abstract In this note, we provide proven estimates for the complexity of the SupportMinors Modeling, mostly confirming the heuristic complexity estimates contained in the original article (Bardet (2020) Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Advances in cryptology. Springer, pp 507–536).
Cabarcas et al. (Mon,) studied this question.