Implementation of a new primality test
Henri Cohen, Arjen K. Lenstra · Mathematics of Computation · 1987
An implementation of the Cohen-Lenstra version of the Adleman-Pomerance-Rumely primality test is presented. Primality of prime numbers of up to 213 decimal digits can now routinely be proved within approximately ten minutes.