This page largely a place holder, sorry.  Perhaps when I get more round tuits it may improve a little.

Agrawal, Kayal and Saxena published a paper on 6 August 2002 entitles PRIMES is in P.   They describe a deterministic algorithm for proving primality which they prove runs in polynomial time.  There's been some confusion about what their result means and its implications for public key cryptography.  A couple of postings of mine to the UKcrypto mailing list were later reposted to the sci.crypt newsgroup.  The original had a slight error, which has been corrected in the version to be found here.

Primes and Strong Pseudoprimes of the form x^y+y^x.   Primes of this form have been valuable for developers of primality proving software.  They have a simple algebraic description, but are not cycloctomic numbers and so are not amenable to the extremely fast special-purpose primality proving algorithms.  Please join in the search for new strong pseudoprimes and/or prove some of the smaller candidates prime.

Until I have more of my own content ready, why not also head over to Chris Caldwell's Prime Pages?

PCL 2004-August-13