Active Bibliography

Modern Primality Tests and the Agrawal-Kayal-Saxena Algorithm – Jason Wojciechowski - 2003
Primality testing – Richard P. Brent - 2003
3 Primality testing – Richard P - 1992
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
7 Automorphisms of Finite Rings and Applications to Complexity of Problems – Manindra Agrawal, Nitin Saxena - 2005
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent - 2006
unknown title – unknown authors - 2004
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
22 The Generation of Random Numbers That Are Probably Prime – Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Carl Pomerance - 1988
6 Towards a deterministic polynomial-time Primality Test – Neeraj Kayal, Nitin Saxena, Supervisor Dr. Manindra Agarwal - 2002
25 On Parallel Hashing and Integer Sorting – Yossi Matias, Uzi Vishkin - 1991
69 Almost All Primes Can be Quickly Certified – Shafi Goldwasser, Joe Kilian
An Exposition of the AKS . . . – Benjamin Linowitz - 2006
12 It Is Easy to Determine Whether a Given Integer Is Prime – Andrew Granville - 2004
6 It Is Easy to Determine Whether a Given Integer Is – Andrew Granville - 2005
Abstract Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
.1 Primality testing cont'd. – The Miller-Rabin Primality