|
|
|
|
Home / Science / Math / Number Theory / Prime Numbers / Primality Tests
|
| Categories |
|
|
|
|
|
|
|
|
Web Sites
|
- 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.
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.
www.eskimo.com/~weidai/lucas.html
- Perrin Numbers - Includes details of primality testing using the Perrin sequence, listing the first 17 Perrin pseudoprimes.
ftp.ai.univie.ac.at/perrin.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."
www.cs.unb.ca/~alopez-o/math-faq/node33.html
- Primality Testing Applet - A small Java applet to interactively perform strong probable primality tests.
www2.vo.lu/homepages/armand/primality/primality.htm
- 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.
www.cse.iitk.ac.in/news/primality.html
|
|
|
|
|