Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!mintaka!bloom-beacon!eru!hagbard!sunic!mcsun!corton!inria!seti!morain
From: morain@seti.inria.fr (morain francois jean)
Newsgroups: comp.theory
Subject: Re: Algebra & Number Theory (& Elliptic Curves Primality Test)
Summary: Now you can have it by ftp
Message-ID: <2016@seti.inria.fr>
Date: 21 Mar 91 18:04:12 GMT
References: <3069@laura.UUCP> <1969@seti.inria.fr>
Organization: INRIA Rocquencourt, Le Chesnay, France.
Lines: 27

In article <1969@seti.inria.fr>, morain@seti.inria.fr (morain francois jean) writes:

> 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.

A lot of people asked me for any an electronic copy of my thesis. 
Here is what I have done. I compressed/tared the psotscript files that form
my thesis. It is available by anonymous ftp from nuri.inria.fr . Here is the
shell output:

ftp> cd local/INRIA-publication
250 CWD command successful.
ftp> ls
INDEX
TE-INRIA-090.tar.Z
RR-INRIA-1320.dvi.Z
RR-1404-dvips.tar.Z
RR-1404.ps.Z

My thesis is recorcded as TE-INRIA-090.tar.Z

If you have any problems with this, please email.

Francois Morain
INRIA
Projet Algorithmes