[RC5] Other future projects

Décio Luiz Gazzoni Filho decio at revistapcs.com.br
Fri Sep 27 21:37:45 EDT 2002

Hash: SHA1

On Friday 27 September 2002 15:49, Ryan Malayter wrote:
> The General Number Field Sieve algortithm (the fastest available to break
> RSA) is very diffucult to parallelize in its entirety. The initial
> "sieving" action is can be made highly parallel, but the results of that
> "sieving" must be stitched together on a single computer with very large
> memory. It took 224 CPU hours and about 3.2 Gbytes of memory on the Cray
> C916 at the SARA Amsterdam Academic Computer Center to solve for the
> 512-bit RSA challenge. Access to a single machine with much, much more
> memory and CPU power will be needed for the remaining RSA challenges (576
> bits and above). This is probably why these contests haven't already been
> attacked by d.net.

There is an algorithm based on elliptic curves, the Elliptic Curve Method of 
Lenstra, which albeit not the fastest one available, is quite fast 
(especially with ``smooth'' numbers, smooth meaning with small prime 
factors), and is parallelizable all the way. Look for more news regarding 
this in the forum tomorrow. 

Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org


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