Xref: utzoo comp.theory:1594 sci.math:15481
Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!dimacs.rutgers.edu!seismo!uunet!mcsun!corton!inria!seti!morain
From: morain@seti.inria.fr (morain francois jean)
Newsgroups: comp.theory,sci.math
Subject: Re: Algebra & Number Theory (& Elliptic Curves Primality Test)
Summary: Read my thesis
Message-ID: <1969@seti.inria.fr>
Date: 1 Mar 91 12:36:22 GMT
References: <3069@laura.UUCP>
Followup-To: comp.theory
Organization: INRIA Rocquencourt, Le Chesnay, France.
Lines: 22

In article <3069@laura.UUCP>, muenx@heike-fbi.informatik.uni-dortmund.de (Holger Muenx) writes:
> 
> Guten Tag!
> 
> In order to implement a primality test with elliptic curves I am currently
> working with an article from A. K. Lenstra and H. W. Lenstra, Jr, namely
> "Algorithms in Number Theory" in the "Handbook of Theoretical Computer
> Science". Unfortunately, they omitted most of the proofs for the discussed
> facts.

Dear Holger Muenx,

You might be interested in reading my thesis, which contains the theory and
practice of the ECPP algorithm (or complex multiplication test), together
with the material used to test 1000 decimal digit numbers for primality.

Yours sincerely,

Francois Morain

PS: the email address you gave in yours articles seems to be unreachable. 
Try to answer me by email, just in case.