A. Worst-case-example and C. , comparison of the usual algorithm for solving the PoSSo problem and Algorithm 16, the proposed algorithm Computation with FGb on a 3, p.100

O. Macaulay-matrix, f s ) in graduation d w.r.t, p.42

.. Computing-h-n-deterministically, 51 11 Polynomial systems solving, 62 12 Solving polynomial systems admitting polynomial change of variables, p.70

M. Leonard, J. Adleman, and . Demarrais, A subexponential algorithm for discrete logarithms over all finite fields, Advances in Cryptology?CRYPTO'93, pp.147-158, 1994.

M. Leonard, J. Adleman, M. Demarrais, and . Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyper-elliptic curves over finite fields, Algorithmic Number Theory 6th International Symposium, 1994.

M. Leonard, . Adleman, A. Ming-deh, and . Huang, Counting rational points on curves and abelian varieties over finite fields, Algorithmic Number Theory, pp.1-16

M. Bardet, Étude des Systèmes Algébriques Surdéterminés Applications aux Codes Correcteurs et à la Cryptographie, 2004.

[. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.3-4235, 1997.
DOI : 10.1006/jsco.1996.0125

[. 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.
DOI : 10.1515/JMC.2009.009
URL : https://hal.archives-ouvertes.fr/hal-01148127

[. Bettale, J. Faugère, and L. Perret, Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic. Designs, Codes and Cryptography, pp.1-52, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00776072

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, Journal of Complexity, vol.29, issue.1, pp.53-75, 2013.
DOI : 10.1016/j.jco.2012.07.001
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, Algebraic Geometry Conference, pp.1-14, 2005.

R. Barbulescu, P. Gaudry, A. Joux, and E. Thomé, A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic, 2013.
DOI : 10.1007/978-3-642-55220-5_1
URL : https://hal.archives-ouvertes.fr/hal-00835446

P. Richard, . Brent, G. Fred, . Gustavson, Y. David et al., Fast solution of Toeplitz systems of equations and computation of Padé approximants, Journal of Algorithms, vol.1, issue.3, pp.259-295, 1980.

J. Bunch and J. Hopcroft, Triangular factorization and inversion by fast matrix multiplication, Mathematics of Computation, vol.28, issue.125, pp.231-236, 1974.
DOI : 10.1090/S0025-5718-1974-0331751-8

J. Daniel, T. Bernstein, and . Lange, Explicit-Formulas Database

J. Daniel, T. Bernstein, and . Lange, Faster addition and doubling on elliptic curves, Advances in Cryptology : ASIACRYPT 2007, pp.29-50, 2007.

H. [. Buhler, C. Lenstra, and . Pomerance, Factoring integers with the number field sieve, Lecture Notes in Mathematics, vol.32, issue.107, pp.50-94, 1993.
DOI : 10.1109/TIT.1986.1057137

A. Borodin and R. Moenck, Fast modular transforms, Journal of Computer and System Sciences, vol.8, issue.3, pp.366-386, 1974.
DOI : 10.1016/S0022-0000(74)80029-2

E. Becker, T. Mora, M. G. Marinari, and C. Traverso, The shape of the Shape Lemma, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.129-133, 1994.
DOI : 10.1145/190347.190382

M. Ben-or and P. Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.301-309, 1988.
DOI : 10.1145/62212.62241

[. Buchmann, A. Pyshkin, and R. Weinmann, A zerodimensional Gröbner basis for AES-128, Fast Software Encryption, pp.78-88, 2006.

S. Basu and M. Roy, Mohab Safey El Din, and Éric Schost. A baby step-giant step roadmap algorithm for general algebraic sets. CoRR, abs/1201, 2012.

W. Baur and V. Strassen, The complexity of partial derivatives. Theoretical computer science, pp.317-330, 1983.

D. Bayer and M. Stillman, A criterion for detectingm-regularity, Inventiones Mathematicae, vol.10, issue.8, pp.1-11, 1987.
DOI : 10.1007/BF01389151

D. Bayer and M. Stillman, lexicographic order, Duke Mathematical Journal, vol.55, issue.2, pp.321-328, 1987.
DOI : 10.1215/S0012-7094-87-05517-7

A. Bostan, B. Salvy, and É. Schost, Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality, Applicable Algebra in Engineering, Communication and Computing, vol.14, issue.4, pp.239-272, 2003.
DOI : 10.1007/s00200-003-0133-5
URL : https://hal.archives-ouvertes.fr/inria-00072296

[. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal, 1965.

[. 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, vol.41, issue.3-4, pp.3-4475, 2006.
DOI : 10.1016/j.jsc.2005.09.007

J. F. Canny, Computing Roadmaps of General Semi-Algebraic Sets, The Computer Journal, vol.36, issue.5, pp.504-514, 1993.
DOI : 10.1093/comjnl/36.5.504

V. David, G. V. Chudnovsky, and . Chudnovsky, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Advances in Applied Mathematics, vol.7, issue.4, pp.385-434, 1986.

M. Arjeh, H. Cohen, H. Cuypers, and . Sterk, Some Tapas of Computer Algebra. Algorithms and Computation in Mathematics Series, 2011.

H. Cohen and G. Frey, Handbook of elliptic and hyperelliptic curve cryptography, 2005.
DOI : 10.1201/9781420034981

C. Chevalley, Invariants of Finite Groups Generated by Reflections, American Journal of Mathematics, vol.77, issue.4, pp.778-782, 1955.
DOI : 10.2307/2372597

G. David, E. Cantor, and . Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Inf, vol.28, issue.7, pp.693-701, 1991.

[. Couveignes and R. Lercier, Galois invariant smoothness basis. Series on Number Theory and Its Applications, pp.142-167, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00373511

[. Cox, J. Little, and D. O. Shea, Ideals, Varieties, and Algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra, 2007.

H. Cohen, A course in computational algebraic number theory, 1993.
DOI : 10.1007/978-3-662-02945-9

A. Colin, Théorie des Invariants Effective Applications à la Théorie de Galois et à la Résolution de Systèmes Algèbriques. Implantation en Axiom, 1997.

[. Coppersmith, Modifications to the Number Field Sieve, Journal of Cryptology, vol.6, issue.3, pp.169-180, 1993.
DOI : 10.1007/BF00198464

[. Couveignes, Algebraic groups and discrete logarithm, Public-key cryptography and computational number theory, pp.17-27, 2001.
DOI : 10.1515/9783110881035.17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.5372

E. Richard, C. Crandall, and . Pomerance, Prime numbers: a computational perspective, 2005.

S. Ruchira and . Datta, Universality of Nash equilibria, Mathematics of Operations Research, vol.28, issue.3, pp.424-432, 2003.

M. De-boer and R. Pellikaan, Some Tapas of Computer Algebra, chapter Gröbner Bases for Codes, Algorithms and Computation in Mathematics Series [CCS11], 2011.

[. Diao and E. Fouotsa, Edwards model of elliptic curves defined over any fields. Cryptology ePrint Archive, 2012.

J. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen et al., LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA, Mathematical Software, pp.40-50, 2002.
DOI : 10.1142/9789812777171_0005

[. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.
DOI : 10.1109/TIT.1976.1055638

[. Diem, An Index Calculus Algorithm for Plane Curves of Small Degree, Algorithmic number theory ANTS-VII, pp.543-557, 2006.
DOI : 10.1007/11792086_38

C. Diem, On the discrete logarithm problem in class groups of curves, Mathematics of Computation, vol.80, issue.273, pp.443-475, 2011.
DOI : 10.1090/S0025-5718-2010-02281-1

C. Diem, Abstract, Compositio Mathematica, vol.6, issue.01, pp.75-104, 2011.
DOI : 10.1112/S0010437X10005075

[. Doche, T. Icart, R. David, and . Kohel, Efficient Scalar Multiplication by Isogeny Decompositions, Public Key Cryptography-PKC 2006, pp.191-206, 2006.
DOI : 10.1007/11745853_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.2150

[. Derksen and G. Kemper, Computational invariant theory, 2002.
DOI : 10.1007/978-3-662-48422-7

C. Diem and E. Thomé, Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three, Journal of Cryptology, vol.38, issue.192, pp.593-611, 2008.
DOI : 10.1007/s00145-007-9014-6
URL : https://hal.archives-ouvertes.fr/inria-00107290

S. Duquesne, Improving the arithmetic of elliptic curves in the Jacobi model, Information Processing Letters, vol.104, issue.3, pp.101-105, 2007.
DOI : 10.1016/j.ipl.2007.05.012
URL : https://hal.archives-ouvertes.fr/lirmm-00145805

M. Harold and . Edwards, A normal form for elliptic curves, In Bulletin of the American Mathematical Society, vol.44, pp.393-422, 2007.

A. Enge and P. Gaudry, A general framework for subexponential discrete logarithm algorithms, Acta Arithmetica, vol.102, issue.1, pp.83-103, 2002.
DOI : 10.4064/aa102-1-6
URL : https://hal.archives-ouvertes.fr/inria-00512717

A. Enge and P. Gaudry, An L (1/3???+?????) Algorithm for the Discrete Logarithm Problem for Low Degree Curves, Advances in Cryptology-EUROCRYPT 2007, pp.379-393, 2007.
DOI : 10.1007/978-3-540-72540-4_22
URL : https://hal.archives-ouvertes.fr/inria-00135324

D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, 1995.

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

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

[. Faugère, FGb: A Library for Computing Gr??bner Bases, Mathematical Software -ICMS 2010, pp.84-87, 2010.
DOI : 10.1007/978-3-642-15582-6_17

J. Faugère, P. Gaudry, and L. Huot, Fast change of ordering with exponent ??, ACM Communications in Computer Algebra, vol.46, issue.3/4, pp.92-93, 2012.
DOI : 10.1145/2429135.2429149

[. Faugère, P. Gaudry, and L. Huot, Using symmetries and fast change of ordering in the index calculus for elliptic curves discrete logarithm, SCC '12: Proceedings of the Third International Conference on Symbolic Computation and Cryptography, pp.113-118, 2012.

J. Faugère, P. Gaudry, and L. Huot, Polynomial systems solving by fast linear algebra, 2013.

[. Faugère, P. Gaudry, and L. Huot, Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm, Journal of Cryptology, vol.32, issue.1, pp.1-41
DOI : 10.1007/s00145-013-9158-5

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

C. M. Fiduccia, Polynomial evaluation via the division algorithm the fast Fourier transform revisited, Proceedings of the fourth annual ACM symposium on Theory of computing , STOC '72, pp.88-93, 1972.
DOI : 10.1145/800152.804900

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.
DOI : 10.1007/978-3-540-45146-4_3

R. W. Floyd, Nondeterministic Algorithms, Journal of the ACM, vol.14, issue.4, pp.636-644, 1967.
DOI : 10.1145/321420.321422

[. Faugère, D. Lubicz, and D. Robert, Computing modular correspondences for abelian varieties, ISSAC '11: Proceedings of the 2011 international symposium on Symbolic and algebraic computation, pp.248-277, 2011.
DOI : 10.1016/j.jalgebra.2011.06.031

[. Faugère and C. Mou, Sparse FGLM algorithms, Journal of Symbolic Computation, vol.80, 2013.
DOI : 10.1016/j.jsc.2016.07.025

[. Feng, M. Nie, and H. Wu, Twisted jacobi intersections curves Theory and Applications of Models of Computation [FP09] Jean-Charles Faugère and Ludovic Perret. An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography, Journal of Symbolic Computation, issue.12, pp.199-210, 2009.

J. Faugère, L. Perret, and C. Petit, Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields, Advances in Cryptology EUROCRYPT 2012, pp.27-44, 2012.
DOI : 10.1007/978-3-642-29011-4_4

[. Faugère and S. Rahmany, Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases, ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.151-158, 2009.

G. Frey, Applications of Arithmetical Geometry to Cryptographic Constructions, International Conference on Finite Fields and Applications, pp.128-161, 2001.
DOI : 10.1007/978-3-642-56755-1_13

J. Faugère and J. Svartz, Gröbner bases of ideals invariant under a commutative group: the non-modular case, ISSAC, pp.347-354, 2013.

[. Faugère, M. Safey-el-din, and P. Spaenlehauer, Gr??bner bases of bihomogeneous ideals generated by polynomials of bidegree <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>: Algorithms and complexity, Journal of Symbolic Computation, vol.46, issue.4, pp.406-437, 2011.
DOI : 10.1016/j.jsc.2010.10.014

[. Faugère, On the complexity of the generalized MinRank problem, Journal of Symbolic Computation, vol.55, pp.30-58, 2013.
DOI : 10.1016/j.jsc.2013.03.004

[. Faugère, Mohab Safey El Din, and Thibaut Verron. On the complexity of computing Gröbner bases for quasi-homogeneous systems, ISSAC, pp.189-196, 2013.

A. Galligo, Algorithmes de calcul de base standards

A. Galligo, A propos du th??or??me de pr??paration de weierstrass, 1973.
DOI : 10.1090/S0002-9947-1968-0217093-3

[. Gaudry, Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, Journal of Symbolic Computation, vol.44, issue.12, pp.1690-1702, 2009.
DOI : 10.1016/j.jsc.2008.08.005
URL : https://hal.archives-ouvertes.fr/inria-00337631

K. Gatermann and F. Guyard, Gr??bner Bases, Invariant Theory and Equivariant Dynamics, Journal of Symbolic Computation, vol.28, issue.1-2, pp.275-302, 1999.
DOI : 10.1006/jsco.1998.0277
URL : http://doi.org/10.1006/jsco.1998.0277

F. Gölo?lu, R. Granger, G. Mcguire, and J. Zumbrägel, On the Function Field Sieve and the Impact of Higher Splitting Probabilities, Cryptology ePrint Archive, 2013.
DOI : 10.1007/978-3-642-40084-1_7

J. Joachim-von-zur-gathen, R. Gutierrez, and . Rubio, On Multivariate Polynomial Decomposition, Applicable Algebra in Engineering, Communication and Computing, vol.14, issue.1, pp.11-31, 2003.
DOI : 10.1007/978-3-642-60218-4_35

[. Gaudry, F. Hess, N. S. , P. Gianni, and T. Mora, Constructive and destructive facets of Weil descent on elliptic curves, Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proceedings of AAECC-5, pp.19-46, 2002.
DOI : 10.1007/s00145-001-0011-x
URL : https://hal.archives-ouvertes.fr/inria-00512763

A. Greuet and M. Safey-el-din, Deciding reachability of the infimum of a multivariate polynomial, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.131-138, 2011.
DOI : 10.1145/1993886.1993910
URL : https://hal.archives-ouvertes.fr/hal-00744469

[. Gaudry and É. Schost, Genus 2 point counting over prime fields, Journal of Symbolic Computation, vol.47, issue.4, pp.368-400, 2012.
DOI : 10.1016/j.jsc.2011.09.003
URL : https://hal.archives-ouvertes.fr/inria-00542650

P. Gaudry, E. Thomé, N. Thériault, and C. Diem, A double large prime variation for small genus hyperelliptic index calculus, Mathematics of Computation, vol.76, issue.257, pp.475-492, 2007.
DOI : 10.1090/S0025-5718-06-01900-4
URL : https://hal.archives-ouvertes.fr/inria-00000897

F. Hess, Computing relations in divisor class groups of algebraic curves over finite fields, 2004.

[. Huang and D. Ierardi, Counting Points on Curves over Finite Fields, Journal of Symbolic Computation, vol.25, issue.1, pp.1-21, 1998.
DOI : 10.1006/jsco.1997.0164

[. Hoffstein, J. Pipher, and J. H. Silverman, NTRU: A ring-based public key cryptosystem, Algorithmic Number Theory, pp.267-288, 1998.
DOI : 10.1007/BFb0054868

E. Jonckheere and C. Ma, A simple Hankel interpretation of the Berlekamp-Massey algorithm, Linear Algebra and its Applications, vol.125, pp.65-76, 1989.
DOI : 10.1016/0024-3795(89)90032-3

A. Joux, Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields, Advances in Cryptology ? EUROCRYPT 2013, pp.177-193, 2013.
DOI : 10.1007/978-3-642-38348-9_11

A. Joux, A new index calculus algorithm with complexity L(1/4 + o(1)) in very small characteristic, Cryptology ePrint Archive, 2013.

A. Joux and V. Vitse, Cover and Decomposition Index Calculus on Elliptic Curves Made Practical, Advances in Cryptology ? EUROCRYPT 2012, pp.9-26, 2012.
DOI : 10.1007/978-3-642-29011-4_3
URL : https://hal.archives-ouvertes.fr/hal-01121942

A. Joux and V. Vitse, Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields, Journal of Cryptology, vol.12, issue.3, pp.119-143, 2013.
DOI : 10.1007/s00145-011-9116-z

R. Kane, Reflection Groups and Invariant Theory, 2001.
DOI : 10.1007/978-1-4757-3542-0

W. Keller-gehrig, Fast algorithms for the characteristics polynomial, Theoretical Computer Science, vol.36, pp.309-317, 1985.
DOI : 10.1016/0304-3975(85)90049-0

E. Kaltofen and Y. Lakshman, Improved sparse multivariate polynomial interpolation algorithms, Symbolic and Algebraic Computation, pp.467-474, 1989.
DOI : 10.1007/3-540-51084-2_44

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

N. Koblitz, Hyperelliptic cryptosystems, Journal of Cryptology, vol.2, issue.4, pp.139-150, 1989.
DOI : 10.1007/BF02252872

N. Yagati and . Lakshman, On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal, Proceedings of the twenty-second annual ACM symposium on Theory of computing, STOC '90, pp.555-563, 1990.

D. Lazard, Gr??bner bases, Gaussian elimination and resolution of systems of algebraic equations, Computer Algebra, pp.146-156, 1983.
DOI : 10.1007/3-540-12868-9_99

D. Lazard, Solving zero-dimensional algebraic systems, Journal of Symbolic Computation, vol.13, issue.2, pp.117-131, 1992.
DOI : 10.1016/S0747-7171(08)80086-7

W. Hendrik and . Lenstra, Factoring integers with elliptic curves, Annals of mathematics, pp.649-673, 1987.

N. Yagati, D. Lakshman, and . Lazard, On the complexity of zero-dimensional algebraic systems, Effective methods in algebraic geometry, p.217, 1991.

P. Loustaunau, V. Eric, and . York, On the decoding of cyclic codes using Gröbner bases Applicable Algebra in Engineering, Communication and Computing, vol.8, issue.6, pp.469-483, 1997.

S. Francis and . Macaulay, The Algebraic Theory of Modular Systems. Cambridge Mathematical Library, 1994.

J. Massey, Shift-register synthesis and bch decoding. Information Theory, IEEE Transactions on, vol.15, issue.1, pp.122-127, 1969.

R. Moenck and A. Borodin, Fast modular transforms via division, 13th Annual Symposium on Switching and Automata Theory (swat 1972), pp.90-96, 1972.
DOI : 10.1109/SWAT.1972.5

[. Matsumoto and H. Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Advances in Cryptology ? EUROCRYPT '88, pp.419-453, 1988.
DOI : 10.1007/3-540-45961-8_39
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2397

S. Victor and . Miller, Use of elliptic curves in cryptography In Lecture notes in computer sciences; 218 on Advances in cryptology?CRYPTO 85, pp.417-426, 1986.

L. Peter and . Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of computation, vol.48, issue.177, pp.243-264, 1987.

C. Mou, Solving Polynomial Systems over Finite Fields, 2013.
URL : https://hal.archives-ouvertes.fr/tel-01110887

A. Menezes, T. Okamoto, and S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field. Information Theory, IEEE Transactions on, vol.39, issue.5, pp.1639-1646, 1993.

[. Mourrain, Y. Victor, and . Pan, Asymptotic acceleration of solving multivariate polynomial systems of equations, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.488-496, 1998.
DOI : 10.1145/276698.276862

[. Moreno-socías, Autour de la fonction de Hilbert-Samuel (escaliers d'ideaux polynomiaux), 1991.

[. Moreno-socias, Degrevlex Gr??bner bases of generic complete intersections, Journal of Pure and Applied Algebra, vol.180, issue.3, pp.263-283, 2003.
DOI : 10.1016/S0022-4049(02)00297-9

A. Menezes, S. Vanstone, and T. Okamoto, Reducing elliptic curve logarithms to logarithms in a finite field, Proceedings of the twenty-third annual ACM symposium on Theory of computing, STOC '91, pp.80-89, 1991.

J. Alfred, . Menezes, C. Paul, . Van-oorschot, A. Scott et al., Handbook of Applied Cryptography, 2010.

[. Nagao, Decomposed attack for the jacobian of a hyperelliptic curve over an extension field, Algorithmic Number Theory

Y. Victor and . Pan, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Journal of Symbolic Computation, vol.33, issue.5, pp.701-733, 2002.

[. Pardue, Nonstandard Borel-Fixed Ideals, 1994.

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

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

S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over< img src=. Information Theory, IEEE Transactions on, vol.24, issue.1, pp.106-110, 1978.

J. Pila, Frobenius maps of abelian varieties and finding roots of unity in finite fields, Mathematics of Computation, vol.55, issue.192, pp.745-763, 1990.
DOI : 10.1090/S0025-5718-1990-1035941-X

J. M. Pollard, Monte carlo methods for index computation mod p, Math. Comp, vol.32, issue.143, pp.918-924, 1978.

C. Petit and J. Quisquater, On Polynomial Systems Arising from a Weil Descent, Asiacrypt 2012, p.2012
DOI : 10.1007/978-3-642-34961-4_28

R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.
DOI : 10.1145/359340.359342

]. J. Sch80 and . Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM, vol.27, issue.4, pp.701-717, 1980.

R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Mathematics of Computation, vol.44, issue.170, pp.483-494, 1985.

I. Semaev, Evaluation of discrete logarithms in a group of p?torsion points of an elliptic curve in characteristic p. Mathematics of Computation of the, pp.353-356, 1998.

I. Semaev, Summation polynomials and the discrete logarithm problem on elliptic curves, Cryptology ePrint Archive Report, vol.031, 2004.

D. Shanks, Class number, a theory of gactorization, and genera, Number Theory Institute (Proc. Sympos, pp.415-440, 1969.

[. Shoup, Lower Bounds for Discrete Logarithms and Related Problems, Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques, pp.256-266, 1997.
DOI : 10.1007/3-540-69053-0_18

H. Joseph and . Silverman, The Arithmetic of Elliptic Curves, 2009.

P. Nigel and . Smart, The discrete logarithm problem on elliptic curves of trace one, Journal of Cryptology, vol.12, issue.3, pp.193-196, 1999.

P. Nigel and . Smart, The Hessian form of an elliptic curve, Cryptographic Hardware and Embedded Systems?CHES 2001, pp.118-125, 2001.

[. Smith, Polynomial Invariants of Finite Groups, Research Notes in Mathematics, 1995.

P. Spaenlehauer, Solving multi-homogeneous and determinantal systems. Algorithms -Complexity -Applications
URL : https://hal.archives-ouvertes.fr/tel-01110756

C. Geoffrey, J. A. Shephard, and . Todd, Finite unitary reflection groups, Canadian J. Math, vol.6, pp.274-304, 1954.

M. Shantz and E. Teske, Solving the elliptic curve discrete logarithm problem using Semaev polynomials, Weil descent and Gröbner basis methods ? an experimental study, Cryptology ePrint Archive, vol.596, 2013.

P. Richard and . Stanley, Hilbert functions of graded algebras, Advances in Mathematics, vol.28, issue.1, pp.57-83, 1978.

[. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.354-356, 1969.
DOI : 10.1007/BF02165411

[. Sturmfels, Solving Systems of Polynomial Equations, 2002.
DOI : 10.1090/cbms/097

[. Sturmfels, Algorithms in Invariant Theory (Texts and Monographs in Symbolic Computation), 2008.

[. Thériault, Index Calculus Attack for Hyperelliptic Curves of Small Genus, Advances in Cryptology : ASIACRYPT 2003, pp.75-92, 2003.
DOI : 10.1007/978-3-540-40061-5_5

[. Williams, Multiplying matrices faster than coppersmith-winograd, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.887-898, 2012.
DOI : 10.1145/2213977.2214056

J. Von and Z. Gathen, Functional decomposition of polynomials: The tame case, Journal of Symbolic Computation, vol.9, issue.3, pp.281-299, 1990.

J. Von and Z. Gathen, Functional decomposition of polynomials: The wild case, Journal of Symbolic Computation, vol.10, issue.5, pp.437-452, 1990.

J. Von, Z. Gathen, and J. Gerhard, Modern Computer Algebra, 2003.

A. Weil, Numbers of solutions of equations in finite fields, Bulletin of the American Mathematical Society, vol.55, issue.5, pp.497-508, 1949.
DOI : 10.1090/S0002-9904-1949-09219-4

H. Douglas and . Wiedemann, Solving sparse linear equations over finite fields, IEEE Trans. Inf. Theor, vol.32, issue.1, pp.54-62, 1986.

N. Huang-yun-ju, C. Shinohara, T. Petit, and . Takagi, Improvement of Faug??re et al.???s Method to Solve ECDLP, IWSEC 2013, p.2013
DOI : 10.1007/978-3-642-41383-4_8

R. Zippel, Probabilistic algorithms for sparse polynomials, Symbolic and Algebraic Computation, pp.216-226, 1979.
DOI : 10.1007/3-540-09519-5_73

R. Zippel, Interpolating polynomials from their values, Journal of Symbolic Computation, vol.9, issue.3, pp.375-403, 1990.
DOI : 10.1016/S0747-7171(08)80018-1
URL : http://doi.org/10.1016/s0747-7171(08)80018-1