On 10/07/2013 05:28 PM, David Johnston wrote:
We are led to believe that if it is shown that P = NP, we suddenly have a
break for all sorts of algorithms.
So if P really does = NP, we can just assume P = NP and the breaks will make
themselves evident. They do not. Hence P != NP.
As
Last week, the American TV show Elementary (a TV who-done-it) was about the
murder of two mathematicians who were working on proof of P=NP. The
implications to crypto, and being able to crack into servers was covered. It
was mostly accurate, up until the deux ex machine of the of the NSA hiding
So their research was stolen and they were assassinated by the NSA? Makes
sense. (Except for the NSA's lack of field agents! CIA involvement is
required)
___
The cryptography mailing list
cryptography@metzdowd.com
On 10/6/2013 12:17 PM, Salz, Rich wrote:
Last week, the American TV show Elementary (a TV who-done-it) was
about the murder of two mathematicians who were working on proof of
P=NP. The implications to crypto, and being able to crack into
servers was covered. It was mostly accurate, up until
