morain@seti.inria.fr (morain francois jean) (03/22/91)
Archive-name: math/number-theory/morain-complex-multiplication/1991-03-21 Archive: nuri.inria.fr:/local/INRIA-publication/TE-INRIA-090.tar.Z [128.93.1.26] Original-posting-by: morain@seti.inria.fr (morain francois jean) Original-subject: Re: Algebra & Number Theory (& Elliptic Curves Primality Test) Reposted-by: emv@msen.com (Edward Vielmetti, MSEN) 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