François Morain's Home Page

François Morain's Home Page

Algorithms

Project

INRIA

Welcome	People	Publications	AofA
Software	Seminars	Books	ECS

E-mail: morain@lix.polytechnique.fr
Current position: Laboratoire d'Informatique de l'École polytechnique (LIX). See my homepage there.

ECPP

The ECPP (Elliptic Curve Primality Proving) algorithm is a powerful general purpose primality proving algorithm described in the articles referred to below as well as in my thesis. I have written a portable C program implementing this test, which is based on the BigNum package. The new version of ecpp can be found here. I am not willing to maintain the old version 3.4.1, which I now consider as dead. hline

Articles

Courbes elliptiques et tests de primalité Thèse, Université de Lyon I, 20 septembre 1990.
Elliptic Curves and Primality Proving A.O.L. Atkin and F. Morain. Mathematics of Computation, vol. 61, no. 203, July 1993.
Finding suitable curves for the Elliptic Curve factoring method A.O.L. Atkin and F. Morain. Mathematics of Computation, vol. 60, no. 201, Jan. 1993.
Other publications

Original URL of this page: http://algo.inria.fr/morain/index.html
Last modified: Monday, March 30, 1998

All documents are under the responsibility of their authors, and do not necessarily represent the official views of INRIA. The information is given in good faith, but its accuracy cannot be guaranteed.