C. Aguilar-melchor, N. Aragon, S. Bettaieb, L. Bidoux, O. Blazy et al., Ouroboros-R. First round submission to the NIST post-quantum cryptography call, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01946902

C. Aguilar-melchor, N. Aragon, S. Bettaieb, L. Bidoux, O. Blazy et al., Rank quasi cyclic (RQC). First round submission to the NIST post-quantum cryptography call, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01946894

C. Aguilar-melchor, N. Aragon, S. Bettaieb, L. Bidoux, O. Blazy et al., Second round submission to the NIST post-quantum cryptography call, 2019.

M. Albrecht and G. Bard, The M4RI Library -Version, The M4RI Team, 2014.

N. Aragon, O. Blazy, J. C. Deneuville, P. Gaborit, A. Hauteville et al., LAKE -Low rAnk parity check codes Key Exchange. First round submission to the NIST post-quantum cryptography call, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01946967

N. Aragon, O. Blazy, J. C. Deneuville, P. Gaborit, A. Hauteville et al., LOCKER -LOw rank parity ChecK codes EncRyption. First round submission to the NIST post-quantum cryptography call, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01946962

N. Aragon, O. Blazy, J. C. Deneuville, P. Gaborit, A. Hauteville et al., ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER). Second round submission to the NIST post-quantum cryptography call, 2019.

N. Aragon, O. Blazy, P. Gaborit, A. Hauteville, and G. Zémor, Durandal: a rank metric based signature scheme, Advances in Cryptology -EUROCRYPT 2019 -38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol.11478, pp.728-758, 2019.

N. Aragon, P. Gaborit, A. Hauteville, O. Ruatta, and G. Zémor, Ranksigna signature proposal for the NIST's call. First round submission to the NIST post-quantum cryptography call, 2017.

N. Aragon, P. Gaborit, A. Hauteville, and J. P. Tillich, A new algorithm for solving the rank syndrome decoding problem, 2018 IEEE International Symposium on Information Theory, pp.2421-2425, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01957179

G. Ars, J. C. Faugère, H. Imai, M. Kawazoe, and M. Sugita, Comparison between XL and Gröbner basis algorithms, 2004.

M. Bardet, Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs età la cryptographie, 2004.

M. Bardet, J. C. Faugère, and B. Salvy, On the complexity of the F5 Gröbner basis algorithm, J. Symbolic Comput, vol.70, pp.49-70, 2015.

M. Bardet, J. C. Faugère, B. Salvy, and B. Y. Yang, Asymptotic expansion of the degree of regularity for semi-regular systems of equations, MEGA'05 -Effective Methods in Algebraic Geometry, pp.1-14, 2005.

C. Bouillaguet and C. Delaplace, Sparse Gaussian elimination modulo p: An update, Proceedings CASC 2016 -Computer Algebra in Scientific Computing, pp.101-116, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01333670

B. Boyer, C. Eder, J. Faugère, S. Lachartre, and F. Martani, GBLA: Gröbner basis linear algebra package, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp.135-142, 2016.

B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, 1965.

J. R. Bunch and J. E. Hopcroft, Triangular factorization and inversion by fast matrix multiplication, Mathematics of Computation, vol.28, issue.125, pp.231-236, 1974.

J. F. Buss, G. S. Frandsen, and J. O. Shallit, The computational complexity of some problems of linear algebra, J. Comput. System Sci, vol.58, issue.3, pp.572-596, 1999.

D. Cabarcas, D. Smith-tone, and J. Verbel, Key recovery attack for ZHFE, Post-Quantum Cryptography 2017, vol.10346, pp.289-308, 2017.

N. Courtois, A. Klimov, J. Patarin, and A. Shamir, Efficient algorithms for solving overdefined systems of multivariate polynomial equations, Advances in Cryptology -EUROCRYPT 2000, pp.392-407, 2000.

D. Cox, J. Little, and D. O'shea, Ideals, Varieties, and algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra, Undergraduate Texts in Mathematics, 2001.

T. Debris-alazard and J. P. Tillich, Two attacks on rank metric code-based schemes: Ranksign and an identity-based-encryption scheme, Advances in Cryptology -ASIACRYPT 2018, pp.62-92, 2018.

J. Ding and T. J. Hodges, Inverting HFE systems is quasi-polynomial for all fields, Advances in Cryptology -CRYPTO, 2011.

J. Ding and T. Kleinjung, Degree of regularity for HFE-. Cryptology ePrint Archive, 2011.

J. Ding and D. Schmidt, Solving degree and degree of regularity for polynomial systems over a finite fields, Number Theory and Cryptography -Papers in Honor of Johannes Buchmann on the Occasion of His 60th Birthday, vol.8260, pp.34-49, 2013.

J. Ding and B. Y. Yang, Degree of regularity for HFEv and HFEv-. In: Post-Quantum Cryptography, pp.52-66, 2013.

V. Dubois and N. Gama, The degree of regularity of HFE systems, Advances in Cryptology -ASIACRYPT 2010, vol.6477, pp.557-576, 2010.

C. Eder and J. C. Faugre, A survey on signature-based algorithms for computing grbner bases, Journal of Symbolic Computation, vol.80, pp.719-784, 2017.

J. C. Faugère, A new efficient algorithm for computing gröbner bases (F4), J. Pure Appl. Algebra, vol.139, issue.1-3, pp.61-88, 1999.

J. C. Faugère, A new efficient algorithm for computing gröbner bases without reduction to zero: F5, Proceedings ISSAC'02, pp.75-83, 2002.

J. C. Faugère, F. Levy-dit-vehel, and L. Perret, Cryptanalysis of Minrank, Advances in Cryptology -CRYPTO 2008, vol.5157, pp.280-296, 2008.

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology, International Symposium on Symbolic and Algebraic Computation, ISSAC 2010, pp.257-264, 2010.

J. C. Faugère, M. Safey-el-din, and P. J. Spaenlehauer, Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity, J. Symbolic Comput, vol.46, issue.4, pp.406-437, 2011.

E. M. Gabidulin, Theory of codes with maximum rank distance, Problemy Peredachi Informatsii, vol.21, issue.1, pp.3-16, 1985.

E. M. Gabidulin, A. V. Paramonov, and O. V. Tretjakov, Ideals over a noncommutative ring and their applications to cryptography, Advances in Cryptology -EUROCRYPT'91, pp.482-489, 1991.

P. Gaborit, G. Murat, O. Ruatta, and G. Zémor, Low rank parity check codes and their application to cryptography, Proceedings of the Workshop on Coding and Cryptography WCC'2013, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00913719

P. Gaborit, O. Ruatta, and J. Schrek, On the complexity of the rank syndrome decoding problem, IEEE Trans. Information Theory, vol.62, issue.2, pp.1006-1019, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01280904

P. Gaborit, O. Ruatta, J. Schrek, and G. Zémor, New results for rank-based cryptography, Progress in Cryptology -AFRICACRYPT 2014, vol.8469, pp.1-12, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01261421

P. Gaborit, O. Ruatta, J. Schrek, and G. Zémor, Ranksign: An efficient signature algorithm based on the rank metric, Post-Quantum Cryptography, vol.8772, pp.88-107, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01261425

P. Gaborit and G. Zémor, On the hardness of the decoding and the minimum distance problems for rank codes, IEEE Trans. Information Theory, vol.62, issue.12, pp.7245-7252, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01443111

L. Granboulan, A. Joux, and J. Stern, Inverting HFE is quasipolynomial, Advances in Cryptology -CRYPTO 2006, vol.4117, pp.345-356, 2006.

J. Hoffstein, J. Pipher, and J. H. Silverman, NTRU: A ring-based public key cryptosystem, Algorithmic Number Theory, Third International Symposium, vol.1423, pp.267-288, 1998.

A. Kipnis and A. Shamir, Cryptanalysis of the HFE public key cryptosystem by relinearization, Advances in Cryptology -CRYPTO'99, vol.1666, pp.19-30

. Springer, , 1999.

D. Lazard, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, proceedings Eurocal'83, vol.162, pp.146-156, 1983.

L. Gall and F. , Powers of tensors and fast matrix multiplication, Proceedings ISSAC'14, pp.296-303, 2014.

,

F. Levy-dit-vehel and L. Perret, Algebraic decoding of rank metric codes, Talk at the Special Semester on Gröbner Bases -Workshop D1, pp.1-19, 2006.

P. Loidreau, A new rank metric codes based encryption scheme, Post-Quantum Cryptography 2017, vol.10346, pp.3-17, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01673462

R. Misoczki, J. P. Tillich, N. Sendrier, and P. S. Barreto, MDPC-McEliece: New McEliece variants from moderate density parity-check codes, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00870929

A. Otmani, H. Talé-kalachi, and S. Ndjeya, Improved cryptanalysis of rank metric schemes based on Gabidulin codes, Des. Codes Cryptogr, vol.86, issue.9, pp.1983-1996, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02189601

A. V. Ourivski and T. Johansson, New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission, vol.38, pp.237-246, 2002.

R. Overbeck, A new structural attack for GPT and variants, Mycrypt. LNCS, vol.3715, pp.50-63, 2005.

A. Storjohann, Algorithms for Matrix Canonical Forms, 2000.

F. Lévy-dit-vehel and L. Perret, Algebraic decoding of codes in rank metric, communication at YACC06, 2006.

J. Verbel, J. Baena, D. Cabarcas, R. Perlner, and D. Smith-tone, On the complexity of "superdetermined" Minrank instances, Post-Quantum Cryptography 2019, vol.11505, pp.167-186, 2019.