[RC5] RSA Secret-Key Challenge Termination
Jim C. Nasby
decibel at distributed.net
Sat May 26 17:31:11 EDT 2007
On Sat, May 26, 2007 at 12:30:14PM -0700, david fleischer wrote:
> RC5 is np-complete, by definition. Which makes it an
> important benchmarking project. Factoring is believed
> to be np-complete, but there isn't any proof. However
> there are quite a number of algorithms, with code ready.
> D.net could adapt this to an applet easily.
Got that running in our public code yet? :)
Jim C. Nasby, Database Architect decibel at distributed.net
Give your computer some brain candy! www.distributed.net Team #1828
Windows: "Where do you want to go today?"
Linux: "Where do you want to go tomorrow?"
FreeBSD: "Are you guys coming, or what?"
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Size: 187 bytes
Desc: not available
Url : http://lists.distributed.net/pipermail/rc5/attachments/20070526/99523f79/attachment.bin
More information about the rc5