Finding suitable paths for the elliptic curve primality proving algorithm
et
30 mai 2014
À propos de cet article
Publié en ligne: 30 mai 2014
Pages: 35 - 52
Reçu: 10 mars 2013
DOI: https://doi.org/10.2478/ausi-2014-0003
Mots clés
© 2014
This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
An important part of the Elliptic Curve Primality Proving algorithm consists of finding a sequence of elliptic curves with appropriate properties. In this paper we consider a strategy to search for an improved sequence, as part of an implementation (implemented in Magma 2.19) to obtain improved heuristics and compare it to an implementation which does not use such heuristics, namely to a built-in Magma function.