Newsgroups: sci.math.research
From: morain@seti.inria.fr (morain francois jean)
Subject: elliptic curve primality prover available
Date: Wed, 25 Sep 1991 15:10:06 GMT
Keywords: Primality proving, elliptic curves, cryptography

After quite a lot of work, I have finished a n+1-th C-BigNum-based
version of my ECPP program. ECPP stands for "Elliptic Curves and
Primality Proving". The algorithm is described in

    A. O. L. Atkin and F. Morain
    "Elliptic curves and primality proving"
    To appear.

It is a deterministic algorithm that gives a certificate of primality
for numbers that can be as large as 10**1000 (one thousand decimal
digits). For more informations, read the README's :-)

The ECPP package is available via anonymous ftp from nuri.inria.fr
(128.93.1.26) as:

	nuri.inria.fr:INRIA/ecpp.V3.4.1.tar.Z

You can also ftp my thesis, which is the most advanced literature so
far on the topic, as:

	nuri.inria.fr:INRIA/publication/TE-INRIA-090.tar.Z

PLEASE: send any mail concerning that program to 

	ecpp@fleurie.inria.fr

Congratulations will be greatly appreciated, at least more than bug reports.

Have fun,

Fran\c{c}ois Morain
morain@inria.inria.fr