Cryptography (Projects)

Cryptography Sites:

The Prime Sierpinski Problem The Prime Sierpinski Problem: Mathematical project to find the smallest prime Sierpinski number. (Cryptography) http://www.geocities.com/eharsh82/ distributed.net distributed.net: A distributed computing project currently trying to take the RSA challenge of RC5-64, and also working on OGR-24 and 25 (Optimal Golomb Rulers). Previous projects included CSC and DES. (Cryptography) http://www.distributed.net/ Great Internet Mersenne Prime Search Great Internet Mersenne Prime Search: Online search for Mersenne prime numbers, found largest several primes. (Cryptography) http://www.mersenne.org/ Seventeen Or Bust Seventeen Or Bust: A distributed attack on the Sierpinski problem, trying to find the last remaining 17 numbers. (Cryptography) http://www.seventeenorbust.com Goldbach's Conjecture and Factoring the Cryptographic Modulus Goldbach's Conjecture and Factoring the Cryptographic Modulus: Algebraic Factoring of the Cryptography Modulus and Proof of Goldbach's Conjecture (Cryptography) http://findprimenumbers.coolissues.com/goldbach.htm Ellipsa - Elliptic Curve Primality Proving Ellipsa - Elliptic Curve Primality Proving: 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. (Cryptography) http://www.ellipsa.net/ ECMNET ECMNET: Project to factor numbers using the elliptic curve method. Client and server software. (Cryptography) http://www.loria.fr/~zimmerma/records/ecmnet.html RSA Security - Challenges RSA Security - Challenges: Monetary prizes for factoring certain large numbers ("RSA Numbers"), as well as breaking RSA and DES encryption schemes; announcements mailing list. (Cryptography) http://www.rsasecurity.com/rsalabs/node.asp?id=2091 Search for the Largest Proth Prime Search for the Largest Proth Prime: An internet group to help find the 5th largest prime number, coordinated by William Garnett. Windows/Linux software available. (Cryptography) http://www.people.iup.edu/vmrf/ Generalized Fermat Primes Search Generalized Fermat Primes Search: Project provides software to search for primes of a specific form. Coordinated via email. (Cryptography) http://perso.wanadoo.fr/yves.gallot/primes/index.html Calculating Pi Calculating Pi: Investigates and implements algorithms which may yield to distributed computation of the mathematical constant Pi. (Cryptography) http://projectpi.sourceforge.net/ The Prime Pages The Prime Pages: Prof. Chris Caldwell's database of virtually every large or otherwise interesting prime number known; includes the 5,000 largest known prime numbers and records for specific types. (Cryptography) http://www.utm.edu/research/primes/ Electronic Frontier Foundation Electronic Frontier Foundation: Cash prizes for discovery of very large prime numbers through Cooperative Computing Awards program. (Cryptography) http://www.eff.org/coop-awards/ Factoring Lucas numbers (GMP-ECM) Factoring Lucas numbers (GMP-ECM): Project to factorize Fibonacci and Lucas numbers using the ECM algorithm. (Cryptography) http://www.1202.org:81/ MM61 MM61: Attempt at factoring the huge Mersenne number 2^(2^61-1)-1. Software for Windows, DOS and Linux. Work reservation via email. (Cryptography) http://www.ltkz.demon.co.uk/ar2/mm61.htm The Riesel Sieve Project The Riesel Sieve Project: Distributed project to help solve the Riesel problem through the use of donated unused CPU cycles. (Cryptography) http://www.rieselsieve.com/