[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <A69B2F68-3A89-11D9-B39F-000D93C0F38C@teknovis.com>
From: andfarm at teknovis.com (Andrew Farmer)
Subject: Time Expiry Alogorithm??
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.
<nitpick>
Factoring primes is a solved problem. You probably mean "factoring the
product of two large primes".
</nitpick>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: PGP.sig
Type: application/pgp-signature
Size: 186 bytes
Desc: This is a digitally signed message part
Url : http://lists.grok.org.uk/pipermail/full-disclosure/attachments/20041119/ec4a3522/PGP.bin
Powered by blists - more mailing lists