M. Ajtai, Acm symposium on the theory of computing 2012, pp.99-108, 1996.

M. R. Albrecht, C. Cid, J. Faugère, R. Fitzpatrick, and L. Perret, On the complexity of the BKW algorithm on LWE, Designs, Codes and Cryptography, vol.74, issue.2, 2012.
DOI : 10.1007/s10623-013-9864-x
URL : https://hal.archives-ouvertes.fr/hal-00776069

M. R. Albrecht, P. Farshim, J. Faugère, and L. Perret, Polly Cracker, Revisited, Advances in Cryptology ? ASIACRYPT 2011, pp.179-196, 2011.
DOI : 10.1007/978-3-642-25385-0_10
URL : https://hal.archives-ouvertes.fr/hal-01112976

M. R. Albrecht, R. Fitzpatrick, and F. Gopfert, On the efficacy of solving lwe by reduction to unique-svp. Cryptology ePrint Archive, 2013.

M. Bardet, Étude 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 of Gröbner basis computation for semi-regular overdetermined sequences over F 2 with solutions in F 2, 2003.

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

T. Becker and V. Weispfenning, Gröbner Bases -A Computational Approach to Commutative Algebra, 1991.

C. Berbain, H. Gilbert, and J. Patarin, QUAD: A multivariate stream cipher with provable security, Journal of Symbolic Computation, vol.44, issue.12, pp.1703-1723, 2009.
DOI : 10.1016/j.jsc.2008.10.004

Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, Classical hardness of learning with errors, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, 2013.
DOI : 10.1145/2488608.2488680
URL : https://hal.archives-ouvertes.fr/hal-00922194

Z. Brakerski and V. Vaikuntanathan, Efficient Fully Homomorphic Encryption from (Standard) LWE, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.97-106, 2011.
DOI : 10.1109/FOCS.2011.12

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

B. Buchberger, G. E. Collins, R. G. Loos, and R. Albrecht, Computer algebra symbolic and algebraic computation, ACM SIGSAM Bulletin, vol.16, issue.4, pp.5-5, 1982.
DOI : 10.1145/1089310.1089312

N. Courtois and L. Goubin, Cryptanalysis of the TTM cryptosystem, Advances in Cryptology ? ASIACRYPT '00, pp.44-57, 1976.

J. Ding and B. Yang, Multivariate Public Key Cryptography, Post-Quantum Cryptography, pp.193-234, 2009.
DOI : 10.1007/978-3-540-88702-7_6

V. Dubois, P. Fouque, A. Shamir, and J. Stern, Practical Cryptanalysis of SFLASH, Lecture Notes in Computer Science, vol.4622, pp.1-12, 2007.
DOI : 10.1007/978-3-540-74143-5_1
URL : https://hal.archives-ouvertes.fr/inria-00556691

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, pp.75-83, 2002.

J. Faugère, F. Levy, L. Vehel, and . Perret, Cryptanalysis of MinRank, Lecture Notes in Computer Science, vol.5157, pp.280-296, 2008.
DOI : 10.1007/978-3-540-85174-5_16

J. Faugère and A. Joux, Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gr??bner Bases, Lecture Notes in Computer Science, vol.2729, pp.44-60, 2003.
DOI : 10.1007/978-3-540-45146-4_3

J. Faugère and L. Perret, Cryptanalysis of 2R??? Schemes, Lecture Notes in Computer Science, vol.4117, pp.357-372, 2006.
DOI : 10.1007/11818175_21

J. Faugère and L. Perret, Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects, Advances in Cryptology ? EUROCRYPT 2006, pp.30-47, 2006.
DOI : 10.1007/11761679_3

N. Gama and P. Q. Nguyen, Predicting Lattice Reduction, Lecture Notes in Computer Science, vol.4965, pp.31-51, 2008.
DOI : 10.1007/978-3-540-78967-3_3

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

G. Gmp, The GNU multiple precision arithmetic library

D. Goldstein and A. Mayer, On the equidistribution of Hecke points, Forum Mathematicum, vol.15, issue.2, 2003.
DOI : 10.1515/form.2003.009

L. Granboulan, A. Joux, and J. Stern, Inverting HFE Is Quasipolynomial, CRYPTO, pp.345-356, 2006.
DOI : 10.1007/11818175_20

Y. Huang, F. Liu, and B. Yang, Public-Key Cryptography from New Multivariate Quadratic Assumptions, Public Key Cryptography ? PKC 2012, pp.190-205, 2012.
DOI : 10.1007/978-3-642-30057-8_12

R. Kannan, Minkowski's Convex Body Theorem and Integer Programming, Mathematics of Operations Research, vol.12, issue.3, pp.415-440, 1987.
DOI : 10.1287/moor.12.3.415

S. Khot, Hardness of approximating the shortest vector problem in lattices, Journal of the ACM, vol.52, issue.5, pp.789-808, 2005.
DOI : 10.1145/1089023.1089027

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

A. Kipnis and A. Shamir, Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization, Advances in Cryptology ? CRYPTO '99, pp.19-30, 1999.
DOI : 10.1007/3-540-48405-1_2

N. Koblitz, Algebraic Aspects of Cryptography, Algorithms and Computation in Mathematics, vol.3, 1998.
DOI : 10.1007/978-3-662-03642-6

L. Lovász, H. W. Lenstra, and A. K. Lenstra, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.261, pp.515-534, 1982.

R. Lindner and C. Peikert, Better Key Sizes (and Attacks) for LWE-Based Encryption, IACR Cryptology ePrint Archive, vol.66, issue.6, p.592, 2010.
DOI : 10.1007/3-540-45708-9_19

Y. Liu, V. Lyubashevsky, and D. Micciancio, On Bounded Distance Decoding for General Lattices, APPROX-RANDOM, pp.450-461, 2006.
DOI : 10.1007/11830924_41

V. Lyubashevsky and D. Micciancio, On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem, Lecture Notes in Computer Science, vol.5677, pp.577-594, 2009.
DOI : 10.1007/978-3-642-03356-8_34

T. Matsumoto and H. Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Advances in Cryptology ? EUROCRYPT 1988, pp.419-453, 1988.
DOI : 10.1007/3-540-45961-8_39

D. Micciancio and S. Goldwasser, Complexity of Lattice Problems: a cryptographic perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science, 2002.
DOI : 10.1007/978-1-4615-0897-7

D. Micciancio and O. Regev, Lattice-based cryptography, Post-Quantum Cryptography, pp.147-191, 2009.

Q. Phong, D. Nguyen, and . Stehlé, Floating-point lll revisited, Lecture Notes in Computer Science, vol.3494, pp.215-233, 2005.

Q. Phong, D. Nguyen, and . Stehlé, An lll algorithm with quadratic complexity, SIAM J. Comput, vol.39, issue.3, pp.874-903, 2009.

A. Novocin, D. Stehlé, and G. Villard, An lll-reduction algorithm with quasilinear time complexity: extended abstract, STOC, pp.403-412, 2011.

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.
DOI : 10.1007/3-540-68339-9_4

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, J. ACM, vol.56, issue.6, 2009.

M. Rückert and M. Schneider, Estimating the security of lattice-based cryptosystems, IACR Cryptology ePrint Archive, p.137, 2010.

V. Shoup, NTL: A library for doing number theory

W. A. Stein, Version 5.2) The Sage Development Team, Sage Mathematics Software, 2012.

A. J. Stothers, On the Complexity of Matrix Multiplication, 2010.

J. Von, Z. Gathen, and J. Gerhard, Modern computer algebra, 2003.

V. Vassilevska and W. , Multiplying matrices faster than Coppersmith-Winograd, STOC, pp.887-898, 2012.

C. Wolf, Multivariate quadratic polynomials in public key cryptography, 2005.

B. Yang and J. Chen, Building Secure Tame-like Multivariate Public-Key Cryptosystems: The New TTS, Lecture Notes in Computer Science, vol.3574, pp.518-531, 2005.
DOI : 10.1007/11506157_43