- Agrawal-Saxena-Kayal polynomial-time primality test (Official page @IITK.AC.IN)
![[Cool]](http://www.cs.ut.ee/~lipmaa/gifs/cool.gif)
-
Previous work (incl. background on Conjecture 4)
- Primality Testing (Pandey, Rajat Bhattacharjee, 2001 (preliminary report))
- An exposition of the Agrawal-Kayal-Saxena primality-proving theorem (Bernstein, 2002 (improved exposition with Lenstra's improvements))
- Deterministic polynomial-time primality tests (Presentation @ Crypto 2002)
- Primalité Théorique et Primalité Pratique ou AKS vs. ECPP (François Morain)
- Finding primes & proving primality (Prime pages)
-
Simple descriptions
- A prime solution (India's "Frontline" magazine)
- Mathworld (wrong in places)
- PRIMES Is in P: Breakthrough for "Everyman" (Folkmar Bornemann)
- Payl Leyland's analysi of complexities
- Primes in P; Run Time! (Bob Silverman)
- Primalité Théorique et Primalité Pratique ou AKS vs. ECPP (François Morain, 2002)
- On some subgroups of the multiplicative group of finite rings (Felipe Voloch)
- Proving primality in essentially quartic expected time (D. J. Bernstein)
- The PRIMES is in P little FAQ (Stiglic)
- Implementation of the AKS algorithm (Yves Gallot (C++))
- Michael Scott (C++/Miracl (Conj. 4))
- Mehdi Tibouchi (pari/gp)
- Allan K. Steel (Magma)
- Peter Luschny (Maple)
![[citeseer]](http://citeseer.ist.psu.edu/icon/cssmall.gif){kind=icon}
gmail.com