  |
Glucas - Yet Another FFT - http://www.oxixares.com/glucas/
Free software program to test primality of Mersenne numbers (numbers with the form 2^n - 1). |
  |
Jean Penné's LLR - http://primes.utm.edu/bios/page.php?id=431
Proves k*2^n-1 with the Lucas-Lehmer-Riesel algorithm and k*2^n+1 with Proth's theorem. Free Windows and Linux download. |
  |
The Prime Pages' Links - http://primes.utm.edu/links/programs/seeking_large_primes/
A set of links to programs to prescreen, test, and prove primality for large primes. |
  |
Primo - http://www.ellipsa.net/
Elliptic Curve Primality Proving program which has set monoprocessor ECPP records. Windows freeware by Marcel Martin. |
  |
ECPP - http://www.lix.polytechnique.fr/~morain/Prgms/ecpp.english.html
An Elliptic Curve Primality Proving program by François Morain. Author has later implemented fastECPP which is not publicly available. |