MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  2 1

Download:
Download as a PDF | Download as a PS
by Preda Mihailescu, Francois Morain
http://www.inf.ethz.ch/~mihailes/papers/cide.ps
Add To MetaCart

Abstract:

Abstract. Elliptic curves and cyclotomy are the current main streams for primality proving. Both rely on relatively simple ideas derived from the Lucas-- Pocklington lemma and use less simple theories. They have been studied and implemented during the last decade. We make a first attempt towards combining methods specific for the two approaches, based on the new concept of dual elliptic primes. Two primes m;n are dual elliptic if there is an elliptic curve mod n having m points and, reciprocally, a curve mod m having n points. Dual elliptic pseudoprimes are two, e.g. strong pseudoprimes, which have additionally the dual elliptic property. It can be proved that, not only are dual elliptic pseudoprimes close in absolute value, but, if they are composite, then their least prime factors are also dual elliptic pseudoprimes and accordingly close. This fact allows a sensible improvement of the final superpolynomial trial division stage of the cyclotomy primality proof [19]. An implementation has been made, by adapting the ECPP [10] implementaion of elliptic curves and the CYCLOPROV cyclotomy program, written, respectively, by the two authors. The implementation has confirmed the theoretical espectations. With this result we improve upon an earlier method of Lenstra [?], which required factored parts sj(n t

Citations

205 Predicate Calculus and Program Semantics – Dijkstra, Scholten - 1990
63 Almost all primes can be quickly certified – Goldwasser, Kilian - 1986
27 Finding irreducible polynomials over finite fields, STOC ’86 – Adleman, Lenstra - 1986
15 A Library for Computational Number Theory – Group - 1997
6 Fast verification, testing and generation of large primes – Plaisted - 1979
3 F.Morain: "Elliptic curves and Primality Proving – Atkin - 1993
3 Site for downloading the elliptic curve primality test software of F .Morain – html
3 Cyclotomy of Rings & Primality Testing", dissertation 12278 – Mihailescu - 1997
2 J.L.Selfridge: "New Primality Criteria and Factorization of 2 m \Sigma 1 – Brillhart - 1975
2 Advances in Cyclotomy Primality Proving ", EMail to the NMBRTHRY mailing list; available on http://listserv.nodak.edu/archives/nbrthry.html – Mihailescu - 1997
2 New Wagstaff Prime Proved", EMail to the NMBRTHRY mailing list; available on http://listserv.nodak.edu/archives/nbrthry.html – Mihailescu - 1998
2 New Ordinary Primality Proving Record", EMail to the NMBRTHRY mailing list; available on http://listserv.nodak.edu/archives/nbrthry.html – Morain - 1997
2 On Lucas and Pepin's Test for Primeness of Mersenne Numbers – Western - 1932
1 D.Shanks: "Strong Primality Tests That are not Sufficient – Adams - 1982
1 Rumely: "On Distinguishing Prime Numbers from Composite Numb ers – Adleman, Pomerance, et al. - 1983
1 M.van der Hulst: "Primality proving with cyclotomy – Bosma - 1990
1 H.W.Lenstra Jr.: "Primality Testing and Jacobi sums – Cohen - 1984
1 J.S.Judd: "Some algorithms for prime testing, using generalized Lehmer functions – Williams - 1976
1 C.R.Zarnke: "Some Prime Numbers of the Forms 2A3 n + 1 and 2A3 n \Gamma 1 – Williams - 1972