Primality proving using elliptic curves: An update

DOI10.1007/BFB0054855MaRDI QIDQ3840154zbMATH OpenFDO

Authors François Morain

Publication date 18 March 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0054855

zbMATH Keywords

choice of parameterscomplex multiplicationelliptic curves primality provingimplementationsurvey

Mathematics Subject Classification ID

Factorization; primality (11A51) Elliptic curves over global fields (11G05) Primality (11Y11) Elliptic curves (14H52)

Review text

Übersicht über neuere Entwicklungen zum Thema ECPP (elliptic curves primality proving), in die Wege geleitet ursprünglich von \textit{S. Goldwasser} und \textit{J. Kilian} [Proc. 18th STOC, 316-329 (1986)] sowie \textit{A. Atkin} and \textit{F. Morain} [Math. Comput. 61, 29-68 (1993; Zbl 0792.11056)]. Die Fortschritte betreffen Implementierung, Parameterwahl und die Konstruktion von elliptischen Kurven mit komplexer Multiplikation vorgegebener Punktezahl \(\text{mod }p\) [\textit{H. Stark}, Rocky Mt. J. Math. 26, 1115-1138 (1996; Zbl 0883.11026)]. Eine Laufzeitabschätzung ist offenbar (noch) nicht bekannt; Erfahrungswerte zeigen, daß ECPP langsamer zu sein scheint als der Galois-Theorie-Primzahltest, das einzige konkurrierende deterministische Verfahren für beliebige sehr große Zahlen. Allerdings scheint ECPP diesem als Beweis- bzw. Kontrollverfahren überlegen zu sein. For the entire collection see [Zbl 0891.00022].

Recommendations

• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• Algorithmic Number Theory
• A strategy for elliptic curve primality proving
• Elliptic Curves and Primality Proving

Cited in

(14)

• Recent developments in primality proving
• Class invariants by Shimura's reciprocity law
• Arithmetic of the level four theta model of elliptic curves
• Primality proving via one round in ECPP and one iteration in AKS
• An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
• On the heuristic of approximating polynomials over finite fields by random mappings
• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• Choosing the correct elliptic curve in the CM method
• Cyclotomy primality proving -- recent developments
• Modularity of Galois traces of class invariants
• scientific article; zbMATH DE number 6941977 (Why is no real title available?)
• Huff's model for elliptic curves
• A strategy for elliptic curve primality proving
• Computing the cardinality of CM elliptic curves using torsion points

Describes a project that uses

Uses Software

• ECPP

This page was built for publication: Primality proving using elliptic curves: An update

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840154)