Finding primes & proving primality
Chapter 4: The general
purpose tests 


Contents of this Chapter:
 The Neoclassical Tests, especially APR and APRCL
 Using Elliptic Curves, especially the ECPP Test
 A Polynomial Time Algorithm
 Conclusion and Suggestions
This is one of four chapters on finding primes and proving primality.
The first is a short introduction and table of contents.
The second chapter discusses finding small primes
and the basic probable primality tests. The third chapter cover the classical
primality tests that have been used to prove primality for 99.99% of the
numbers on the largest known prime list.
The last chapter (these pages) introduces the general
purpose tests that do not require factorization.