[RC5] possible third project...

Ryan Malayter rmalayter at bai.org
Fri Jul 27 12:31:15 EDT 2001

Given to the running time of the General Number Field Sieve, RSA-576
factorization should take about 13 million times the computer resources than
RSA-512 factorization took.

We know what the researches who cracked RSA-512 used... The question is, do
we have enough computer power (comparatively) to make the sieving operation
a feasible project? And will those results even be usable, given that the
back-end, single-computer operation will be many times larger - perhaps too
large for even the biggest supercomputers?


-----Original Message-----
From: Greg Wooledge [mailto:greg at wooledge.org] 
Sent: Thursday, July 26, 2001 5:08 PM
To: rc5 at lists.distributed.net
Subject: Re: [RC5] possible third project...

Mathieu Gilbert (wilbrod at videotron.ca) wrote:

> Nice ... that would be a great project, easy to understand and to 
> explain(so you can get newbie installing the client even if they don't 
> know anything about computers/math/.. not too long to complete ..

Hah!  Factoring even the lowest of the current RSA factoring challenges is
definitely non-trivial.  The fastest know general factoring algorithm (the
Number Field Sieve) can be parallelized in the first stage, but then the
results of the first stage have to be fed to a single large computer for a
few weeks of crunching.

(The RSA-155 challenge, which involved factoring a 155-decimal-digit number,
required several weeks of processing on a 4-CPU Alpha box with 4 GB of RAM.)

> Moreover dnet and someone could make some easy money.

Believe me, any such money would be *earned*. :)

Greg Wooledge                  |   "Truth belongs to everybody."
greg at wooledge.org              |    - The Red Hot Chili Peppers
http://wooledge.org/~greg/     |
To unsubscribe, send 'unsubscribe rc5' to majordomo at lists.distributed.net
rc5-digest subscribers replace rc5 with rc5-digest

More information about the rc5 mailing list