R. Azarderakhsh, B. Koziel, M. Campagna, B. Lamacchia, C. Costello et al., Supersingular isogeny key encapsulation, 2017.

K. Belabas, H. W. Lenstra, J. , and D. B. Zagier, Explicit methods in number theory, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00932377

D. J. Bernstein, Scaled remainder trees, 2004.

D. J. Bernstein, Reducing lattice bases to find small-height values of univariate polynomials, Algorithmic number theory: lattices

P. Gaudry, Fast genus 2 arithmetic based on Theta functions, J. Mathematical Cryptology, vol.1, issue.3, pp.243-265, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00000625

W. B. Hart, F. Johansson, S. Pancratz, and . Flint, Fast Library for Number Theory, 2020. Development version

D. Harvey, Faster algorithms for the square root and reciprocal of power series, vol.80, pp.387-394, 2011.

M. Hittmeir, A babystep-giantstep method for faster deterministic integer factorization, Mathematics of Computation, vol.87, issue.314, pp.2915-2935, 2018.

A. Hutchinson, J. Legrow, B. Koziel, and R. Azarderakhsh, Further optimizations of CSIDH: A systematic approach to efficient strategies, permutations, and bound vectors, 2019.

D. Jao and L. De-feo, Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies, pp.19-34, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00652846

D. Kohel, K. E. Lauter, C. Petit, and J. Tignol, On the quaternion ?-isogeny path problem
URL : https://hal.archives-ouvertes.fr/hal-01257092

D. R. Kohel, Endomorphism rings of elliptic curves over finite fields, 1996.

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

G. Malajovich and J. P. Zubelli, Tangent Graeffe iteration, Numerische Mathematik, vol.89, issue.4, pp.749-782, 2001.

M. Meyer, F. Campos, and S. Reith, On lions and elligators: An efficient constant-time implementation of CSIDH, pp.307-325, 2019.

M. Meyer and S. Reith, A faster way to the CSIDH, INDOCRYPT, pp.137-152, 2018.

M. Peter-lawrence, An FFT extension of the elliptic curve method of factorization, UCLA, 1992.

D. Moody and D. Shumow, Analogues of Vélu's formulas for isogenies on alternate models of elliptic curves, Mathematics of Computation, vol.85, issue.300, pp.1929-1951, 2016.

J. Morgenstern, Algorithmes linéaires tangents et complexité. Comptes Rendus Hebdomadaires des Séances de l, Académie des Sciences, Série A, vol.277, pp.367-369

D. B. Mumford, On the equations defining abelian varieties, I. Inventiones Mathematicae, vol.1, issue.4, pp.287-354, 1966.

H. Onuki, Y. Aikawa, T. Yamazaki, and T. Takagi, Short Paper) A faster constant-time algorithm of CSIDH keeping two points, Advances in Information and Computer Security, pp.23-33, 2019.

J. M. Pollard, Theorems on factorization and primality testing, vol.76, pp.521-528, 1974.

L. R. Rabiner, R. W. Schafer, and C. M. Rader, The chirp-z transform algorithm, IEEE Transactions on Audio and Electroacoustics, vol.17, pp.86-92, 1969.

J. Renes, Computing isogenies between Montgomery curves using the action of (0, 0). PQCrypto, pp.229-247, 2018.

A. Rostovtsev and A. Stolbunov, Public-key cryptosystem based on isogenies, 2006.

. Volker-strassen, Einige Resultateüber Berechnungskomplexität, Jahresbericht der Deutschen Mathematiker-Vereinigung, vol.78, pp.1-8, 1976.

. Volker-strassen, The computational complexity of continued fractions, SIAM Journal on Computing, vol.12, pp.1-27, 1983.

, The Sage Developers. SageMath, the Sage Mathematics Software System, vol.9, p.2020

J. Vélu, Comptes Rendus Hebdomadaires des Séances de l, Académie des Sciences, Série A, vol.273, pp.238-241