Additional
Information: Testing an integer for prime or composite character. Probabilisitc tests yield an answer with high probability of correctness, primality proofs yield an answer which is certain to be correct, often with a certificate of primality which can be verified mo This page was last updated on August 29th, 2008
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
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/
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
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
Contrast Primality Tests
A report by Minjae Kim. http://www.csam.iit.edu/~cs549/cs549/project/Contrastprimalitytests.htm
Primality Testing Applet
A small Java applet to interactively perform strong probable primality tests. http://www.2357.a-tu.net/index.php?link=Primality
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