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?
Umm, no, not sure (hence the IIRC). Apparently, I am nearing an age where this disclaimer is actually necessary... In <http://en.wikipedia.org/wiki/Integer_factorization> it is stated that the problem is known to be sub-exponential but that no polynomial algorithm is known. I think, I was referring to the primality test, which is known to be in P since sometime in 2002. > That'd put RSA into deep trouble. And not only RSA. Sorry, sorry, don't panic ;-) cu, Sven _______________________________________________ Gnupg-users mailing list Gnupg-users@gnupg.org http://lists.gnupg.org/mailman/listinfo/gnupg-users
