, Supersingular isogeny key encapsulation, 2017.
Explicit methods in number theory, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00932377
Scaled remainder trees, 2004. ,
Reducing lattice bases to find small-height values of univariate polynomials, Algorithmic number theory: lattices ,
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
, Fast Library for Number Theory, 2020. Development version
Faster algorithms for the square root and reciprocal of power series, vol.80, pp.387-394, 2011. ,
A babystep-giantstep method for faster deterministic integer factorization, Mathematics of Computation, vol.87, issue.314, pp.2915-2935, 2018. ,
Further optimizations of CSIDH: A systematic approach to efficient strategies, permutations, and bound vectors, 2019. ,
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies, pp.19-34, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00652846
On the quaternion ?-isogeny path problem ,
URL : https://hal.archives-ouvertes.fr/hal-01257092
Endomorphism rings of elliptic curves over finite fields, 1996. ,
Factoring integers with elliptic curves, Annals of mathematics, pp.649-673, 1987. ,
Tangent Graeffe iteration, Numerische Mathematik, vol.89, issue.4, pp.749-782, 2001. ,
On lions and elligators: An efficient constant-time implementation of CSIDH, pp.307-325, 2019. ,
A faster way to the CSIDH, INDOCRYPT, pp.137-152, 2018. ,
An FFT extension of the elliptic curve method of factorization, UCLA, 1992. ,
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. ,
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 ,
On the equations defining abelian varieties, I. Inventiones Mathematicae, vol.1, issue.4, pp.287-354, 1966. ,
Short Paper) A faster constant-time algorithm of CSIDH keeping two points, Advances in Information and Computer Security, pp.23-33, 2019. ,
, Theorems on factorization and primality testing, vol.76, pp.521-528, 1974.
The chirp-z transform algorithm, IEEE Transactions on Audio and Electroacoustics, vol.17, pp.86-92, 1969. ,
Computing isogenies between Montgomery curves using the action of (0, 0). PQCrypto, pp.229-247, 2018. ,
Public-key cryptosystem based on isogenies, 2006. ,
Einige Resultateüber Berechnungskomplexität, Jahresbericht der Deutschen Mathematiker-Vereinigung, vol.78, pp.1-8, 1976. ,
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
Comptes Rendus Hebdomadaires des Séances de l, Académie des Sciences, Série A, vol.273, pp.238-241 ,