W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system. I. The user language, Computational algebra and number theory, vol.24, pp.235-265, 1993.

D. Bayer and M. Stillman, A criterion for detecting m-regularity. Inventiones Mathematicae, vol.87, pp.1-12, 1987.

A. Caminata and E. Gorla, Solving multivariate polynomial systems and an invariant from commutative algebra, 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, International Conference on the Theory and Application of Cryptographic Techniques, pp.392-407, 2000.

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

J. Charles-faugère, A new efficient algorithm for computing Gröbner bases (F4), Journal of Pure and Applied Algebra, vol.139, issue.1, pp.61-88, 1999.

J. Charles-faugère, Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases, Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC '02, pp.44-60, 2002.

A. Ming-deh, M. Huang, S. Kosters, and . Yeo, Last fall degree, HFE, and Weil descent attacks on ECDLP, Advances in Cryptology -CRYPTO 2015, pp.581-600, 2015.

A. Ming-deh, M. Huang, Y. Kosters, S. Yang, and . Yeo, On the last fall degree of zero-dimensional Weil descent systems, Journal of Symbolic Computation, vol.87, pp.207-226, 2018.

D. Lazard, Gröbner bases, gaussian elimination and resolution of systems of algebraic equations, Computer Algebra, pp.146-156, 1983.

J. Patarin, Two New Families of Asymmetric Algorithms, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP), vol.1070, pp.33-48, 1996.