[TriLUG] Prime number discovery?

[Tanner Lovelace]

On Mon, 2002-08-12 at 10:48, Benjamin Reed wrote:

> >From what I've read, the algorithm drastically reduces that computation,
> but does not reduce the time it takes to *factor* numbers made from
> large primes, so i shouldn't affect strong crypto.
> 
> I'm no mathematician though, so I don't know many specifics.

Hi Jeremy,

As you say above, this doesn't do anything for factoring large
non-prime numbers, so RSA should still be pretty safe. :-)

This actually doesn't come as much of a surprise since there
was already an almost polynomial time algorithm for determining
if a number is prime or not.

Tanner
-- 
Tanner Lovelace | lovelace at wayfarer.org | http://wtl.wayfarer.org/
--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--
GPG Fingerprint = A66C 8660 924F 5F8C 71DA  BDD0 CE09 4F8E DE76 39D4
GPG Key can be found at http://wtl.wayfarer.org/lovelace.gpg.asc
--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--*--
          Si hoc legere scis, nimium eruditionis habes.