Least Primitive Root of Prime Numbers  
   Empirical and statistical results showing the smallest base required to prove a number is prime. Includes theory and conjectures.
   http://www.ieeta.pt/~tos/p-roots.html

Lucas Sequences in Cryptography  
   Focus on their use in primality testing, with pseudo-code. Includes an explanation of the strong Lucas PRP test.
   http://www.eskimo.com/~weidai/lucas.html

Perrin Numbers  
   Includes details of primality testing using the Perrin sequence, listing the first 17 Perrin pseudoprimes.
   http://ftp.ai.univie.ac.at/perrin.html

PRIMES Is In P  
   A deterministic polynomial time primality test, developed by Manindra Agarwal, Nitin Saxena and Neeraj Kayal of IIT Kanpur. Preprint in PS/PDF and links to media reports.
   http://www.cse.iitk.ac.in/news/primality.html

The PRIMES is in P Little FAQ  
   Answers to some frequently asked question about the recent proof that PRIMES is in P, compiled by Anton Stiglic.
   http://crypto.cs.mcgill.ca/~stiglic/PRIMES_P_FAQ.html

Detecting False Reports In Primality Tests By The Oddcomp(z) Method  
   Presents a probabilistic primality test based on power series.
   http://web.singnet.com.sg/~huens/paper23.htm

Contrast Primality Tests  
   A report by Minjae Kim.
   http://www.csam.iit.edu/~cs549/cs549/project/Contrastprimalitytests.htm

Primality Testing  
   The problem of primality testing and factorization are two distinct problems. If we concentrate on primality testing, we never need to know the actual factors. The only question to be answered is "is the number in question prime or composite."
   http://db.uwaterloo.ca/~alopez-o/

Primality Testing Applet  
   A small Java applet to interactively perform strong probable primality tests.
   http://www.2357.a-tu.net/index.php?link=Primality