=. .. V-?, ? s ), with ? i = ?(i) . Finally, let Z 1 , . . . , Z s = Y ?(1) , . . . , Y ?(s) As a result, Q = (P, W, ?) is a primitive representation for the ideal I = T in F q [Z], with ? s = 1. We are thus in a position to apply Proposition 19: this provides us with the triangular set T (or proves it does not exist). The total time reported in Propositions 15 and 19 is an expected s 2 ? 1+? log(q) plog ? (log(q)) bit operations. To do the change of basis R T ? R T , we first convert from R T to F q, Let further W 1 = V ?(1) this takes s ? 1+? log(q) plog ? (log(q))

C. J. Accettella, G. M. Del-corso, and G. Manzini, Inversion of two level circulant matrices over Zp, Linear Algebra and its Applications, vol.366, pp.5-23, 2003.
DOI : 10.1016/S0024-3795(02)00471-8

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974.

M. E. Alonso, E. Becker, M. Roy, and T. Wörmann, Zeros, multiplicities and idempotents for zerodimensional systems, MEGA 94, pp.1-15, 1996.

A. O. Atkin, The number of points on an elliptic curve modulo a prime (II) Available at http://listserv, 1992.

P. Aubry, D. Lazard, and M. M. Maza, On the Theories of Triangular Sets, Journal of Symbolic Computation, vol.28, issue.1-2, pp.45-124, 1999.
DOI : 10.1006/jsco.1999.0269
URL : https://hal.archives-ouvertes.fr/hal-01148870

I. Blake, G. Seroussi, and N. Smart, Elliptic curves in cryptography, 1999.
DOI : 10.1017/CBO9781107360211

A. Bostan, P. Flajolet, B. Salvy, and . Schost, Fast computation of special resultants, Journal of Symbolic Computation, vol.41, issue.1, pp.1-29, 2006.
DOI : 10.1016/j.jsc.2005.07.001
URL : https://hal.archives-ouvertes.fr/inria-00000960

A. Bostan, G. Lecerf, and . Schost, Tellegen's principle into practice, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.37-44, 2003.
DOI : 10.1145/860854.860870

A. Bostan, M. F. Chowdhury, J. Van-der-hoeven, and . Schost, Homotopy methods for multiplication modulo triangular sets, Journal of Symbolic Computation

R. P. Brent and H. T. Kung, Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM, vol.25, issue.4, pp.581-595, 1978.
DOI : 10.1145/322092.322099

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory, 1997.
DOI : 10.1007/978-3-662-03338-8

L. S. Charlap, R. Coley, and D. P. Robbins, Enumeration of rational points on elliptic curves over finite fields. Draft, 1991.

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.251-280, 1990.
DOI : 10.1145/28395.28396

X. Dahan, M. Moreno-maza, ´. E. Schost, and Y. Xie, On the complexity of the D5 principle, Transgressive Computing, pp.149-168, 2006.
DOI : 10.1145/1113439.1113457

J. Zur-gathen, Functional decomposition of polynomials, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp.281-299, 1990.
DOI : 10.1109/SFCS.1987.29

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

J. Zur-gathen and V. Shoup, Computing Frobenius maps and factoring polynomials, computational complexity, vol.10, issue.2, pp.187-224, 1992.
DOI : 10.1007/BF01272074

P. Gianni and T. Mora, Algebrric solution of systems of polynomirl equations using Groebher bases, AAECC'5, pp.247-257, 1989.
DOI : 10.1007/3-540-51082-6_83

M. Giusti, J. Heintz, J. E. Morais, J. Morgenstern, and L. M. Pardo, Straight-line programs in geometric elimination theory, Journal of Pure and Applied Algebra, vol.124, issue.1-3, pp.101-146, 1998.
DOI : 10.1016/S0022-4049(96)00099-0

M. Giusti, G. Lecerf, and B. Salvy, A Gr??bner Free Alternative for Polynomial System Solving, Journal of Complexity, vol.17, issue.1, pp.154-211, 2001.
DOI : 10.1006/jcom.2000.0571

X. Huang and V. Y. Pan, Fast Rectangular Matrix Multiplication and Applications, Journal of Complexity, vol.14, issue.2, pp.257-299, 1998.
DOI : 10.1006/jcom.1998.0476
URL : http://doi.org/10.1006/jcom.1998.0476

´. E. Hubert, Notes on Triangular Sets and Triangulation-Decomposition Algorithms I: Polynomial Systems, Symbolic and numerical scientific computation, pp.1-39, 2003.
DOI : 10.1007/3-540-45084-X_1

M. Kalkbrener, A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties, Journal of Symbolic Computation, vol.15, issue.2, pp.143-167, 1993.
DOI : 10.1006/jsco.1993.1011

E. Kaltofen, Greatest common divisors of polynomials given by straight-line programs, Journal of the ACM, vol.35, issue.1, pp.231-264, 1988.
DOI : 10.1145/42267.45069

E. Kaltofen, Challenges of Symbolic Computation: My Favorite Open Problems, Journal of Symbolic Computation, vol.29, issue.6, pp.891-919, 2000.
DOI : 10.1006/jsco.2000.0370

E. Kaltofen and Y. Laskhman, Improved sparse multivariate polynomial interpolation algorithms, ISSAC'88, pp.467-474, 1989.
DOI : 10.1007/3-540-51084-2_44

K. S. Kedlaya and C. Umans, Fast Polynomial Factorization and Modular Composition, SIAM Journal on Computing, vol.40, issue.6
DOI : 10.1137/08073408X
URL : http://authors.library.caltech.edu/28972/1/Kedlaya2011p16787Siam_J_Comput.pdf

R. Lercier and T. Sirvent, Elkies subgroups of elliptic curve -torsion points, pp.783-797, 2008.

X. Li, M. Moreno-maza, and . Schost, Fast arithmetic for triangular sets, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.891-907, 2009.
DOI : 10.1145/1277548.1277585

F. Morain, P. Mihailescu, and . Schost, Computing the eigenvalue in the Schoof- Elkies-Atkin algorithm using Abelian lifts, ISSAC'07, pp.285-292, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00130142

M. M. Maza, On triangular decompositions of algebraic varieties, NAG Ltd, 1999.

V. Y. Pan, Simple Multivariate Polynomial Multiplication, Journal of Symbolic Computation, vol.18, issue.3, pp.183-186, 1994.
DOI : 10.1006/jsco.1994.1042
URL : http://doi.org/10.1006/jsco.1994.1042

C. Pascal and . Schost, Change of order for bivariate triangular sets, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.277-284, 2006.
DOI : 10.1145/1145768.1145814

C. Peters, Bestimmung des Elkies-Faktors im Schoof-Elkies-Atkin-Algorithmus, 2006.

D. Reischert, Asymptotically fast computation of subresultants, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.233-240, 1997.
DOI : 10.1145/258726.258792

F. Rouillier, Solving zero-dimensional systems through the Rational Univariate Representation Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.5, pp.433-461, 1999.

R. Schoof and ´. E. Schost, Elliptic curves over finite fields and the computation of square roots mod p Mathematics of Computation Complexity results for triangular sets, Journal of Symbolic Computation, vol.44, issue.36, pp.483-4943, 1985.

V. Shoup, New algorithms for finding irreducible polynomials over finite fields, Mathematics of Computation, vol.54, issue.189, pp.435-447, 1990.
DOI : 10.1090/S0025-5718-1990-0993933-0

V. Shoup, A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic, Proceedings of the 1991 international symposium on Symbolic and algebraic computation , ISSAC '91, pp.14-21, 1991.
DOI : 10.1145/120694.120697

V. Shoup, Fast Construction of Irreducible Polynomials over Finite Fields, Journal of Symbolic Computation, vol.17, issue.5, pp.371-391, 1994.
DOI : 10.1006/jsco.1994.1025

C. Umans, Fast polynomial factorization and modular composition in small characteristic, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.481-490, 2008.
DOI : 10.1145/1374376.1374445

L. Yang, X. Hou, and B. Xia, A complete algorithm for automated discovering of a class of inequality-type theorems, Science in China Series F Information Sciences, vol.11, issue.1, pp.33-49, 2001.
DOI : 10.1007/BF02713938