Re: New algorithm for finding prime factor of large numbers

From: Robert J. Bradbury (bradbury@aeiveos.com)
Date: Sat Aug 31 2002 - 04:00:24 MDT


On Sat, 31 Aug 2002, Eugen Leitl wrote:

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

Pretty good when you are answering my questions before I even
get a chance to ask them!

(Eliezer -- isn't this one of the "Signs of the Singularity?")

At any rate -- could someone offer any thoughts on how much
privacy/security gets lost if quantum computing falls out of
the sky on top of our collective heads? (Presumably the
government has a lock on quantum computers for the first
N years (where N is hopefully in single digits)). [I think
its the folks at the Univ. of Michigan that seem to be
pushing the edge of the envelope here and its moving much
faster than I would have expected.]

Mind you I'm relatively ambivalent about such technology.
I'm happy to have the government cracking the private keys
of potential terrorists but certainly less happy to have them
cracking *my* private keys. (I realize that statement may be
FUBAR for people who understand cryptography, but I'm sure
you understand what I mean.)

Robert

[On a side-side note, Eugen, since we are exploring names
on here-to-fore unexplored depths, are you using Eugen
as a more easternized/preferred/continental(?) pronuciation
for your name or are we just dealing with keystroke
minimization?]



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