M. Albrecht, J. Faugère, P. Farshim, and L. Perret, Polly cracker, revisited, Advances in Cryptology Asiacrypt 2011, pp.179-196, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01112976

G. Ars, J. Faugère, H. Imai, M. Kawazoe, and M. Sugita, Comparison between xl and gröbner basis algorithms, Lecture Notes in Computer Science, vol.3329, pp.338-353, 2004.

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

M. Bardet, J. Faugère, and B. Salvy, Complexity study of Gröbner basis computation, 2002.

M. Bardet, J. Faugère, and B. Salvy, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations, International Conference on Polynomial System Solving ? ICPSS, pp.71-75, 2004.

M. Bardet, J. Faugère, B. Salvy, and P. Spaenlehauer, On the complexity of solving quadratic boolean systems, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00655745

M. Bardet, J. Faugère, B. Salvy, and B. Yang, Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems, The Effective Methods in Algebraic Geometry Conference ? MEGA 2005, pp.1-14, 2005.

L. Bettale, J. Faugère, and L. Perret, Hybrid approach for solving multivariate systems over finite fields, Journal of Mathematical Cryptology, vol.3, issue.3, pp.177-197, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01148127

C. Bouillaguet, H. Chen, C. Cheng, T. Chou, R. Niederhagen et al., Fast exhaustive search for polynomial systems in f 2, CHES, pp.203-218, 2010.

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

B. Buchberger, Bruno buchberger's phd thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, Journal of Symbolic Computation, pp.41-44, 2006.

B. Buchberger, G. E. Collins, R. G. Loos, and R. Albrecht, Computer algebra symbolic and algebraic computation, SIGSAM Bull, vol.16, issue.4, pp.5-5, 1982.

C. Cid, S. Murphy, and M. J. Robshaw, Algebraic aspects of the advanced encryption standard, 2006.

N. Courtois, L. Goubin, and J. Patarin, SFLASHv3, a fast asymmetric signature scheme, 2003.

N. Courtois and J. Pieprzyk, Cryptanalysis of block ciphers with overdefined systems of equations, Lecture Notes in Computer Science, vol.2501, pp.267-287, 2002.

N. T. Courtois and G. V. Bard, Algebraic cryptanalysis of the data encryption standard, Cryptography and Coding '07, pp.152-169, 2007.

I. Dinur and A. Shamir, Cube attacks on tweakable black box polynomials, Lecture Notes in Computer Science, vol.5479, pp.278-299

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

J. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F5), Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation ISSAC, pp.75-83, 2002.

J. Faugère, F. L. Vehel, and L. Perret, Cryptanalysis of minrank, Lecture Notes in Computer Science, vol.5157, pp.280-296

J. Faugère, P. M. Gianni, D. Lazard, and T. Mora, Efficient computation of zero-dimensional gröbner bases by change of ordering, J. Symb. Comput, vol.16, issue.4, pp.329-344, 1993.

J. Faugère and A. Joux, Algebraic cryptanalysis of Hidden Field Equation (HFE) cryptosystems using Gröbner bases, Advances in Cryptology ? CRYPTO 2003, pp.44-60, 2003.

J. Faugère, A. Otmani, L. Perret, and J. Tillich, Algebraic cryptanalysis of mceliece variants with compact keys, Advances in Cryptology ? EUROCRYPT 2010, pp.279-298, 2010.

J. Faugère, L. Perret, C. Petit, and G. Renault, Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Field, Proceedings of Eurocrypt 2012, pp.1-15, 2012.

R. Fröberg, An inequality for Hilbert series of graded algebras, Math. Scand, vol.56, issue.2, pp.117-144, 1985.

S. Gao, Y. Guan, and F. Volny, A new incremental algorithm for computing groebner bases, pp.13-19, 2010.

A. Kipnis, J. Patarin, and L. Goubin, Unbalanced oil and vinegar signature schemes, Advances in Cryptology ? EUROCRYPT '99, pp.206-222, 1999.

A. Kipnis and A. Shamir, Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization, Advances in Cryptology ? CRYPTO '99, pp.19-30, 1999.

A. Kipnis and A. Shamir, Cryptanalysis of the hfe public key cryptosystem by relinearization, Lecture Notes in Computer Science, vol.1666, pp.19-30, 1999.

T. Matsumoto and H. Imai, Public quadratic polynomial-tuples for efficient signature-verification and message-encryption, Advances in Cryptology ? EUROCRYPT '88, pp.419-453, 1988.

J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms, Advances in Cryptology ? EUROCRYPT '96, pp.33-48, 1996.

K. Sakumoto, T. Shirai, and H. Hiwatari, Public-key identification schemes based on multivariate quadratic polynomials, Lecture Notes in Computer Science, vol.6841, pp.706-723

M. Sugita, M. Kawazoe, L. Perret, and H. Imai, Algebraic cryptanalysis of 58-round SHA-1, Fast Software Encryption, pp.349-365, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01336553

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

B. Yang and J. Chen, Theoretical analysis of xl over small fields, Lecture Notes in Computer Science, vol.3108, pp.277-288, 2004.

B. Yang, J. Chen, and N. Courtois, On asymptotic security estimates in xl and gröbner bases-related algebraic cryptanalysis, Lecture Notes in Computer Science, vol.3269, pp.401-413, 2004.