Anonymous (nobody@replay.com)
Mon, 18 May 1998 23:05:11 +0200 (MET DST)
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.
>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.
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:17:27 ADT