C. Alonso, J. Gutierrez, and T. Recio, A Rational Function Decomposition Algorithm by Near-separated Polynomials, Journal of Symbolic Computation, vol.19, issue.6, pp.527-544, 1995.
DOI : 10.1006/jsco.1995.1030

A. O. Atkin, The number of points on an elliptic curve modulo a prime (II)

D. J. Bernstein, Composing Power Series Over a Finite Ring in Essentially Linear Time, Journal of Symbolic Computation, vol.26, issue.3, pp.339-341, 1998.
DOI : 10.1006/jsco.1998.0216

D. J. Bernstein, Removing redundancy in high-precision Newton iteration, 2000.

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

R. P. Brent, MULTIPLE-PRECISION ZERO-FINDING METHODS AND THE COMPLEXITY OF ELEMENTARY FUNCTION EVALUATION, Analytic computational complexity, pp.151-176
DOI : 10.1016/B978-0-12-697560-4.50014-9

R. P. Brent, F. G. Gustavson, and D. Y. Yun, Fast solution of toeplitz systems of equations and computation of Pad?? approximants, Journal of Algorithms, vol.1, issue.3, pp.259-295, 1980.
DOI : 10.1016/0196-6774(80)90013-9

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

E. Brier and M. Joye, Fast Point Multiplication on Elliptic Curves through Isogenies, Lecture Notes in Computer Science, vol.2643, pp.43-50, 2003.
DOI : 10.1007/3-540-44828-4_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.6968

D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683

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

S. Cook, On the minimum computation time of functions, Transactions of the American Mathematical Society, vol.142, 1966.
DOI : 10.1090/S0002-9947-1969-0249212-8

J. Couveignes, Quelques calculs en théorie des nombres, Thèse, 1994.

J. Couveignes, Computing l-isogenies using the p-torsion, Proceedings of the Second International Symposium , ANTS-II, pp.59-65, 1996.
DOI : 10.1007/3-540-61581-4_41

J. Couveignes, Isomorphisms between Artin-Schreier towers, Mathematics of Computation, vol.69, issue.232, pp.1625-1631, 2000.
DOI : 10.1090/S0025-5718-00-01193-5

J. Couveignes, L. Dewaghe, and F. Morain, Isogeny cycles and the Schoof-Elkies- Atkin algorithm, 1996.

J. Couveignes and T. Henocq, Action of Modular Correspondences around CM Points, Algorithmic Number Theory Proceedings of the 5th International Symposium, ANTS-V, pp.234-243, 2002.
DOI : 10.1007/3-540-45455-1_19

J. Couveignes and F. Morain, Schoof's algorithm and isogeny cycles, Algorithmic Number Theory 1st Algorithmic Number Theory Symposium -Cornell University, pp.43-58, 1994.
DOI : 10.1007/3-540-58691-1_42
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.9220

L. Dewaghe, Isogénie entre courbes elliptiques, Utilitas Mathematica, vol.55, pp.123-127, 1999.

C. Doche, T. Icart, and D. R. , Efficient Scalar Multiplication by Isogeny Decompositions, Cryptology ePrint Archive Report, vol.420, 2005.
DOI : 10.1007/11745853_13

N. D. Elkies, Elliptic and modular curves over finite fields and related computational issues, Computational Perspectives on Number Theory: Proceedings of a Conference in Honor of A. O. L. Atkin, pp.21-76, 1998.
DOI : 10.1090/amsip/007/03

M. Fouquet and F. Morain, Isogeny Volcanoes and the SEA Algorithm, Algorithmic Number Theory Proceedings of the 5th International Symposium, ANTS-V, pp.276-291, 2002.
DOI : 10.1007/3-540-45455-1_23

S. Galbraith, Abstract, LMS Journal of Computation and Mathematics, vol.549, pp.118-138, 1999.
DOI : 10.2307/2006496

S. D. Galbraith, F. Hess, and N. P. Smart, Extending the GHS Weil Descent Attack, Advances in cryptology?EUROCRYPT 2002, pp.29-44, 2002.
DOI : 10.1007/3-540-46035-7_3

J. Zur-gathen and J. Gerhard, Modern computer algebra, 1999.
DOI : 10.1017/CBO9781139856065

H. Gunji, The hasse invariant andp-division points of an elliptic curve, Archiv der Mathematik, vol.145, issue.1, pp.148-158, 1976.
DOI : 10.1007/BF01224654

J. Gutierrez and T. Recio, A practical implementation of two rational function decomposition algorithms, Papers from the international symposium on Symbolic and algebraic computation , ISSAC '92, pp.152-157, 1992.
DOI : 10.1145/143242.143298

G. Hanrot, M. Quercia, and P. Zimmermann, The Middle Product Algorithm I, Applicable Algebra in Engineering, Communication and Computing, vol.14, issue.6, pp.415-438, 2004.
DOI : 10.1007/s00200-003-0144-2
URL : https://hal.archives-ouvertes.fr/inria-00071921

D. Jao, S. D. Miller, and R. Venkatesan, Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?, Advances in Cryptology ? ASIACRYPT 2005 11th International Conference on the Theory and Application of Cryptology and Information Security, pp.21-40, 2005.
DOI : 10.1007/11593447_2

A. Joux and R. Lercier, Counting points on elliptic curves in medium characteristic, Cryptology ePrint Archive Report, vol.176, 2006.

E. Kaltofen and V. Shoup, Subquadratic-time factoring of polynomials over finite fields, Mathematics of Computation, vol.67, issue.223, pp.1179-1197, 1998.
DOI : 10.1090/S0025-5718-98-00944-2

K. S. Kedlaya, Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology, Journal of the Ramanujan Mathematical Society, vol.16, issue.4, pp.323-338, 2001.

H. T. Kung, On computing reciprocals of power series, Numerische Mathematik, vol.264, issue.5, pp.341-348, 1974.
DOI : 10.1007/BF01436917

R. Lercier, Computing isogenies in $$\mathbb{F}_{2^n } $$, Proceedings of the Second International Symposium, ANTS-II, pp.197-212, 1996.
DOI : 10.1007/3-540-61581-4_55

R. Lercier, Algorithmique des courbes elliptiques dans les corps finis, Thèse, ´ Ecole polytechnique, 1997.
URL : https://hal.archives-ouvertes.fr/tel-01101949

R. Lercier and F. Morain, Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm, Mathematics of Computation, vol.69, issue.229, pp.351-370, 2000.
DOI : 10.1090/S0025-5718-99-01081-9

F. Morain, Calcul du nombre de points sur une courbe elliptique dans un corps fini : aspects algorithmiques, Journal de Th??orie des Nombres de Bordeaux, vol.7, issue.1, pp.255-282, 1995.
DOI : 10.5802/jtnb.143

V. Müller, Ein Algorithmus zur Bestimmung der Punktanzahl elliptischer Kurvenüber Kurven¨Kurvenüber endlichen Körpern der Charakteristik größer drei, 1995.

A. Rostovtsev and A. Stolbunov, Public-key cryptosystem based on isogenies, Cryptology ePrint Archive Report, vol.145, 2006.

T. Satoh, The canonical lift of an ordinary elliptic curve over a finite field and its point counting, Journal of the Ramanujan Mathematical Society, vol.15, pp.247-270, 2000.

A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, 1982.

A. Schönhage and V. Strassen, Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971.
DOI : 10.1007/BF02242355

R. Schoof, Counting points on elliptic curves over finite fields, Journal de Th??orie des Nombres de Bordeaux, vol.7, issue.1, pp.219-254, 1995.
DOI : 10.5802/jtnb.142

V. Shoup, A New Polynomial Factorization Algorithm and its Implementation, Journal of Symbolic Computation, vol.20, issue.4, pp.363-397, 1995.
DOI : 10.1006/jsco.1995.1055

V. Shoup, The Number Theory Library, 1996.

M. Sieveking, Ein Algorithmus f??r Potenzreihendivision, Computing, vol.10, issue.1-2, pp.153-156, 1972.
DOI : 10.1007/BF02242389

J. H. Silverman, The arithmetic of elliptic curves, Graduate Texts in Mathematics, vol.106, 1986.

J. H. Silverman, Advanced topics in the arithmetic of elliptic curves, Graduate Texts in Mathematics, vol.151, 1994.
DOI : 10.1007/978-1-4612-0851-8

N. P. Smart, An Analysis of Goubin???s Refined Power Analysis Attack, Cryptographic Hardware and Embedded Systems ? CHES 2003, pp.281-290, 2003.
DOI : 10.1007/978-3-540-45238-6_23

H. M. Stark, Class-numbers of complex quadratic fields Modular functions of one variable I, Proceedings International Summer School University of, pp.155-174, 1972.

E. Teske, An Elliptic Curve Trapdoor System, Journal of Cryptology, vol.19, issue.1, pp.115-133, 2006.
DOI : 10.1007/s00145-004-0328-3

J. Vélu, Isogénies entre courbes elliptiques. Comptes-Rendus de l'Académie des Sciences, Série I, pp.238-241, 1971.