Engineering↗
Atkin-Morain Elliptic Curve Primality Proving
ECPP: using complex multiplication to construct curves of known order, avoiding point counting entirely.
Every page in the KEVOS library tagged primality proving. 4 pages.
ECPP: using complex multiplication to construct curves of known order, avoiding point counting entirely.
The overall design of the Jacobi sum primality test, its two phases, and where its complexity comes from.
Primality proving by elliptic curves with known point counts, its recursive certificate, and the point-counting bottleneck.
The methods available for proving primality, their complexities, and which to use for a given size of candidate.