Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:17:27 ADT
Bruce Schneier (schneier@counterpane.com)
Mon, 18 May 1998 22:24:44 -0500
At 11:05 PM 5/18/98 +0200, Anonymous wrote:
>Even inefficient algorithms like rho, p-1 and p+1 can be effective
>against some fraction of keys if countermeasures are not taken. There is
>more to evaluating an algorithm than looking at its average performance.
>You have to look at the tradeoff between performance and fraction of keys.
Yes, but the more efficient algorithms are, well, more efficient...even against
that subset. The subset of algorithms that can be more easily broken by
Pollard Rho than by NFS or even QFS is negligible.
>From the abstract, it sounds like the claim is that the improved version
>is effective against a larger fraction of keys than had previously been
>thought possible.
That would be interesting, I grant you.
My feeling is generally that strong primes are good, even though there is no
reason to have them right now. There may be a reason in the future, and
it can't hurt (we hope).
Bruce
**********************************************************************
Bruce Schneier, President, Counterpane Systems Phone: 612-823-1098
101 E Minnehaha Parkway, Minneapolis,MN 55419 Fax: 612-823-1590
http://www.counterpane.com
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:17:27 ADT