Checking the Condition C_p
The central congruence condition of the Jacobi sum test, what it asserts, and how it is verified in practice.
Every page in the KEVOS library tagged Primality. 7 pages.
The central congruence condition of the Jacobi sum test, what it asserts, and how it is verified in practice.
Why proving compositeness is easy, proving primality is harder, and factoring is harder still — and what this asymmetry means in practice.
The Pocklington-Lehmer N−1 test, partial factorisation requirements, the N+1 test with Lucas sequences, and combined methods.
The Fermat test and its failure on Carmichael numbers, the strong probable prime test of Miller-Rabin, error bounds, deterministic base sets for bounded ranges, and Baillie-PSW.
Goldwasser-Kilian and Atkin-Morain elliptic curve primality proving: the group order downstep, the CM method for avoiding point counting, certificate structure and verification.
The separation between primality testing and factoring, compositeness tests versus primality proofs, probable primes, pseudoprimes, and how to select a testing strategy.
The Adleman-Pomerance-Rumely test and its Cohen-Lenstra refinement: cyclotomic extensions, characters and Jacobi sums, the basic test, and the final trial division stage.