On 27 Jun 2008, at 00:37, Neil Bothwick wrote:
On Fri, 27 Jun 2008 00:47:34 +0200, Sebastian Günther wrote:
If the NSA had a sufficient algorithm, that is capable of
reducing the time that much, they should also be able to prove P=NP.
This is worth 1.000.000$ iirc and somehow you should get a Nobel
Prize
for it.
I'm sure the NSA would be happy to forego the prize and keep quiet
about
being able to break a secure cipher.
I can't help wondering if - since P=NP is such a big problem - the
advantages of having this knowledge in the public domain might
override the advantages of mere spying.
Stroller.
--
[email protected] mailing list
