RSA Weak?

Alexander W. Janssen yalla at fsfe.org
Fri Nov 2 22:05:01 CET 2007


On 11/2/07, Sven Radde <email at sven-radde.de> wrote:
> Alexander W. Janssen schrieb:
> >> In fact, some mathematician has proven that factoring is a polynomial
> >> problem, IIRC.
> >
> > A P-problem? Really?! Factoring primes is a polynomal problem nowadays?
> > Are you SURE about that?
> I think, I was referring to the primality test, which is known to be in
> P since sometime in 2002.

Ha, I made the same wrongful assumption. My fault. *Testing* primes is
in a different class than *factoring* primes.

> Sorry, sorry, don't panic ;-)

:-)

> cu, Sven

Alex.


-- 
"I am tired of all this sort of thing called science here... We have spent
millions in that sort of thing for the last few years, and it is time it
should be stopped."
 -- Simon Cameron, U.S. Senator, on the Smithsonian Institution, 1901.


.



More information about the Gnupg-users mailing list