Finding suitable paths for the elliptic curve primality proving algorithm
By: Antal Járai and Gyöngyvér Kiss
Abstract
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.
DOI: https://doi.org/10.2478/ausi-2014-0003 | Journal eISSN: 2066-7760
Language: English
Page range: 35 - 52
Submitted on: Mar 10, 2013
Published online: May 30, 2014
Published in print: Jul 1, 2013
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Keywords:
Related subjects:
© 2014 Antal Járai, Gyöngyvér Kiss, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
