| 1 |
On 27 Jun 2008, at 00:37, Neil Bothwick wrote: |
| 2 |
|
| 3 |
> On Fri, 27 Jun 2008 00:47:34 +0200, Sebastian Günther wrote: |
| 4 |
> |
| 5 |
>> If the NSA had a sufficient algorithm, that is capable of |
| 6 |
>> reducing the time that much, they should also be able to prove P=NP. |
| 7 |
>> This is worth 1.000.000$ iirc and somehow you should get a Nobel |
| 8 |
>> Prize |
| 9 |
>> for it. |
| 10 |
> |
| 11 |
> I'm sure the NSA would be happy to forego the prize and keep quiet |
| 12 |
> about |
| 13 |
> being able to break a secure cipher. |
| 14 |
|
| 15 |
I can't help wondering if - since P=NP is such a big problem - the |
| 16 |
advantages of having this knowledge in the public domain might |
| 17 |
override the advantages of mere spying. |
| 18 |
|
| 19 |
Stroller. |
| 20 |
|
| 21 |
-- |
| 22 |
gentoo-user@l.g.o mailing list |
Archives