Home page logo

fulldisclosure logo Full Disclosure mailing list archives

Re: Time Expiry Alogorithm??
From: Andrew Farmer <andfarm () teknovis com>
Date: Fri, 19 Nov 2004 16:18:06 -0800

On 19 Nov 2004, at 10:50, Anders Langworthy wrote:
Pavel Kankovsky wrote:
Now the other possibility: That somebody discovers a better way to factor primes (please don tinfoil hats before replying to tell me that the NSA has already done this, in Area 51, with help from Elvis). Mathematically, this is a very remote possibility, as factoring primes is probably an NP problem, and P is probably not NP. Neither of these has been proven, however.

Even allowing for the miniscule possibility that there is a shortcut to factoring primes, that doesn't necessarily mean that factoring huge primes will be an easy task. Using larger keys will still provide a measure of security.


Factoring primes is a solved problem. You probably mean "factoring the product of two large primes".


Attachment: PGP.sig
Description: This is a digitally signed message part

  By Date           By Thread  

Current thread:
[ Nmap | Sec Tools | Mailing Lists | Site News | About/Contact | Advertising | Privacy ]