W. W. Adams and P. Loustaunau, An Introduction to Gröbner Bases, Graduate Studies in Mathematics. AMS, vol.3, 1994.

G. Ars, J. Faugère, H. Imai, M. Kawazoe, and M. Sugita, Comparison Between XL and Gr??bner Basis Algorithms, Asiacrypt' 04, pp.338-353, 2004.
DOI : 10.1007/978-3-540-30539-2_24

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4696

M. Bardet, ´ Etude des Systèmes Algébriques Surdéterminés Applications aux Codes Correcteurs etàet`età la Cryptographie, Thèse de Doctorat, 2004.

M. Bardet, J. Faugère, B. Salvy, and B. Yang, Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems, MEGA'05, Eighth International Symposium on Effective Methods in Algebraic Geometry, 2005.

B. Buchberger, Gröbner Bases: an Algorithmic Method in Polynomial Ideal Theory. Recent trends in multidimensional systems theory, 1985.

B. Buchberger, G. Collins, and R. Loos, Computer algebra symbolic and algebraic computation, ACM SIGSAM Bulletin, vol.16, issue.4, 1992.
DOI : 10.1145/1089310.1089312

N. Courtois, A. Klimov, J. Patarin, and A. Shamir, Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, Eurocrypt' 00, pp.392-407, 2000.
DOI : 10.1007/3-540-45539-6_27

D. A. Cox, J. B. Little, and D. Shea, Ideals, Varieties, and Algorithms: an Introduction to Computational Algebraix Geometry and Commutative Algebra, Undergraduate Texts in Mathematics, 1992.

J. Ding, C. Wolf, and B. Yang, ???-Invertible Cycles for $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic ( ${\mathcal{MQ}}$ ) Public Key Cryptography, PKC '07, pp.266-281, 2007.
DOI : 10.1007/978-3-540-71677-8_18

V. Dubois, P. Fouque, A. Shamir, and J. Stern, Practical Cryptanalysis of SFLASH, Crypto '07, 2007.
DOI : 10.1007/978-3-540-74143-5_1

URL : https://hal.archives-ouvertes.fr/inria-00556691

V. Dubois, P. Fouque, and J. Stern, Cryptanalysis of SFLASH with Slightly Modified??Parameters, Eurocrypt '07, pp.264-275, 2007.
DOI : 10.1007/978-3-540-72540-4_15

URL : https://hal.archives-ouvertes.fr/inria-00556692

J. Faugère, A new efficient algorithm for computing Gr??bner bases (F4), Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.61-68, 1999.
DOI : 10.1016/S0022-4049(99)00005-5

J. Faugère, A New Efficient Algorithm for Computing Gröbner Basis without Reduction to Zero: F5, ISSAC, pp.75-81, 2002.

J. Faugère, P. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344, 1993.
DOI : 10.1006/jsco.1993.1051

J. Faugère and A. Joux, Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gr??bner Bases, Crypto' 03, pp.44-60, 2003.
DOI : 10.1007/978-3-540-45146-4_3

J. Faugère and L. Perret, Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects, Eurocrypt' 06, pp.30-47, 2006.
DOI : 10.1007/11761679_3

A. Kipnis, J. Patarin, and L. Goubin, Unbalanced Oil and Vinegar Signature Schemes, Eurocrypt' 99, pp.206-222, 1999.
DOI : 10.1007/3-540-48910-X_15

A. Kipnis and A. Shamir, Cryptanalysis of the oil and vinegar signature scheme, Crypto' 98, pp.257-266, 1998.
DOI : 10.1007/BFb0055733

F. S. Macaulay, The Algebraic Theory of Modular Systems, 1916.

T. Matsumoto and H. Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Eurocrypt '88, pp.419-453, 1988.
DOI : 10.1007/3-540-45961-8_39

J. Patarin, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt???88, Crypto '95, pp.248-261, 1995.
DOI : 10.1007/3-540-44750-4_20

J. Patarin, Asymmetric Cryptography with a Hidden Monomial, Crypto '96, pp.45-60, 1996.
DOI : 10.1007/3-540-68697-5_4

J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, Eurocrypt '96, pp.33-48, 1996.
DOI : 10.1007/3-540-68339-9_4

J. Patarin, N. Courtois, and L. Goubin, FLASH, a Fast Multivariate Signature Algorithm, CT-RSA 2001, pp.298-307, 2001.
DOI : 10.1007/3-540-45353-9_22

A. Shamir, Efficient Signature Schemes Based on Birational Permutations, Crypto '93, pp.1-12, 1993.
DOI : 10.1007/3-540-48329-2_1

P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, vol.26, issue.5, pp.1484-1509, 1997.
DOI : 10.1137/S0097539795293172

C. Wolf and B. Preneel, Equivalent Keys in HFE, C*, and Variations, Mycrypt '05, pp.33-49, 2005.
DOI : 10.1007/11554868_4

C. Wolf and B. Preneel, Taxonomy of Public Key Schemes based on the problem of Multivariate Quadratic equations, Cryptology ePrint Archive, 2005.