Home > Computers > Computer Science > Distributed Computing > Projects > Cryptography
This category is for distributed computing projects to either discover prime numbers, or factor very large numbers.
http://projectpi.sourceforge.net/
Investigates and implements algorithms which may yield to distributed computation of the mathematical constant Pi.
http://www.distributed.net/
A distributed computing project currently working on RC5-72 and OGR-27 (Optimal Golomb Rulers). Previous projects included CSC and DES.
http://www.loria.fr/~zimmerma/records/ecmnet.html
Project to factor numbers using the elliptic curve method. Client and server software.
http://www.ellipsa.eu/
Primo, a primality proving program based on the ECPP algorithm. With Primo one can check crypto-primes and prove whether or not they are actually prime.
http://pagesperso-orange.fr/yves.gallot/primes/
Project provides software to search for primes of a specific form. Coordinated via email.
http://www.coolissues.com/mathematics/Goldbach/goldbach.htm
Algebraic Factoring of the Cryptography Modulus and Proof of Goldbach's Conjecture
http://www.mersenne.org/
Online search for Mersenne prime numbers, found largest several primes.
http://www.seventeenorbust.com/
A distributed attack on the Sierpinski problem, trying to find the last remaining 17 numbers.
http://www.mersenneforum.org/showthread.php?t=2665
Mathematical project to find the smallest prime Sierpinski number.
Home > Computers > Computer Science > Distributed Computing > Projects > Cryptography
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us