Re: New algorithm for finding prime factor of large numbers

From: Eugen Leitl (eugen@leitl.org)
Date: Sat Aug 31 2002 - 03:14:33 MDT


On Sat, 31 Aug 2002, John K Clark wrote:

> Actually a better algorithm to test if a number was prime would strengthen
> Public Key codes not weaken them, because then it would be practical to

Sidenote: not all PKIs will be affected by primality testing/factoring
methods. Elliptic curve crypto e.g. won't be affected.

> use a larger key. It would be of no help in factoring numbers and that's
> what you need to do if you want to break the code.



This archive was generated by hypermail 2.1.5 : Sat Nov 02 2002 - 09:16:35 MST