Abstract. The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm.Problema, números primos a compositis dignoscendi, hosque in factores suos primos resolvendi, ad gravissima ac utilissima totius arithmeticae pertinere, et geometrarum turn veterum turn recentiorum industriam ac sagacitatem occupavisse, tarn notum est, ut de hac re copióse loqui superfluum foret.C. F. Gauss [38, Art. 329]
Abstract. The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm.Problema, números primos a compositis dignoscendi, hosque in factores suos primos resolvendi, ad gravissima ac utilissima totius arithmeticae pertinere, et geometrarum turn veterum turn recentiorum industriam ac sagacitatem occupavisse, tarn notum est, ut de hac re copióse loqui superfluum foret.C. F. Gauss [38, Art. 329]
We survey algorithms for computing isogenies between elliptic curves defined
over a field of characteristic either 0 or a large prime. We introduce a new
algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from the
characteristic) in time quasi-linear with respect to $\ell$. This is based in
particular on fast algorithms for power series expansion of the Weierstrass
$\wp$-function and related functions
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.