Primality Proving Using Elliptic Curves: An Update

In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the one hand, and Atkin on the other. The latter algorithm uses the theory of complex multiplication. The algorithm, now called ECPP, has been used for nearly ten years. The purpose of this paper is to give an account of the recent theoretical and practical improvements of ECPP, as well as new benchmarks for integers of various sizes and a new primality record.

• Type: Conference
• Year: 1998
• Where: ANTS
• Authors: François Morain
• Keywords: Algorithms, ANTS 1998, Complex Multiplication, Elliptic Curves, Finite Fields