Atkin–Morain

Atkin–Morain
Name	Atkin–Morain elliptic curve primality proving
Inventor	A. O. L. Atkin; François Morain
Introduced	1993
Domain	Number theory
Classification	Primality proving
Related	Elliptic curve primality proving, Lucas sequences, AKS algorithm

Atkin–Morain is a deterministic elliptic curve primality proving method developed by A. O. L. Atkin and François Morain that uses complex multiplication and modular functions to certify primality for large integers. The method builds on classical ideas from Gauss, Heegner, and Cox about imaginary quadratic fields and adapts modern computational techniques from Silveman, Silverman, and Schoof to produce practical proofs used by projects like PrimeGrid and researchers at institutions such as CNRS and INRIA. It has been used alongside algorithms like AKS algorithm and tests by Miller–Rabin and Fermat primality test in computational number theory.

History and development

Atkin and Morain introduced their elliptic curve primality proving approach in the early 1990s following work by Goldwasser, Kilian, and Lenstra on randomized and deterministic primality certificates. The evolution ties to breakthroughs by Weber and Hilbert in class field theory and to computational advances exemplified by the Fast Fourier transform implementations of Cooley and Tukey used in large integer arithmetic. Early implementations were developed with contributions from researchers at University of Cambridge, École Normale Supérieure, and Princeton University; later practitioners included teams from Microsoft Research and the University of Paris-Sud. Benchmarks that compared Atkin–Morain to algorithms by Adleman, Pomerance, and Rumely showed substantial practical improvements on numbers used in projects like Great Internet Mersenne Prime Search.

Mathematical background

The test relies on properties of elliptic curves over finite fields pioneered by Hasse, Tate, and Weil and on complex multiplication theory developed by Kronecker and Shimura. It uses modular equations related to Dedekind eta function and Modular polynomial computations linked to work by Ramanujan and Hecke. The criterion for primality invokes class invariants from imaginary quadratic orders studied by Stark and Cox and requires point counting results connected to Schoof–Elkies–Atkin algorithm adaptations. Underlying algebraic number theory draws on concepts from Dedekind, Noether, and Artin about ideal class groups and ring of integers in quadratic fields.

The Atkin–Morain elliptic curve primality test

The core procedure constructs an elliptic curve with complex multiplication by an imaginary quadratic order using class polynomials influenced by computations of Hilbert class field generators. Given a candidate integer N, the test attempts to find discriminants from lists related to Heegner numbers and Baker–Stark bounds for which a curve E can be defined modulo N. After obtaining E and a point P, the algorithm performs scalar multiplications using techniques from Montgomery ladder and verifies order conditions tied to Lucas sequences from Lucas and primality criteria akin to those by Pocklington and Bach. If checks succeed, the method produces an explicit certificate verifiable by routines similar to those in PARI/GP and Magma used by groups at University College London and École Polytechnique.

Algorithmic implementation and optimizations

Practical implementations optimize modular polynomial evaluation via algorithms attributed to Brent and Zimmermann and accelerate large-integer arithmetic using multiplication algorithms from Karatsuba and Schönhage–Strassen. Use of fast point arithmetic employs models like Weierstrass, Montgomery curve, and Edwards curve forms adapted by researchers at California Institute of Technology and Massachusetts Institute of Technology. Memory and storage optimizations borrow techniques used in Elliptic Curve Method implementations by teams at University of Bonn and CWI. Parallelization strategies align with distributed computing paradigms used by BOINC projects and software toolchains such as GMP and FLINT maintained by contributors from University of Warwick and Max Planck Institute.

Applications and impact

Atkin–Morain provided the first truly practical deterministic primality proofs for many large primes used in cryptography by standards bodies like NIST and ISO. It influenced primality proving libraries in OpenSSL and inspired subsequent research by Goldreich, Håstad, and Lenstra Jr. on verification efficiency. The technique has been used to certify primes for projects at Los Alamos National Laboratory, University of California, Berkeley, and Oracle Corporation and informed randomness assumptions in protocols studied at RSA Conference and Black Hat USA. Its ideas also permeated textbooks by Koblitz, Washington, and Cohen on computational number theory.

Examples and notable results

Notable successes include certificates for large primes discovered in collaborations between PrimeGrid and academic groups at CNRS and verification of special-form primes related to work by Fermat and Mersenne researchers. Demonstrations of the test were reported in proceedings of International Congress of Mathematicians and journals edited by Annals of Mathematics and Journal of Number Theory, with implementations referenced in software repositories linked to GitHub projects maintained by contributors from INRIA. The Atkin–Morain method remains a cornerstone cited alongside algorithms by Agrawal, Kayal, and Saxena for deterministic primality proving.

Category:Primality tests