[dundee] P != NP (Cryptographers sigh in relief)

[Rick Moynihan]

HP Labs claim to have proven that P != NP.  This was one of the
biggest outstanding proofs in maths and computer science.

http://science.slashdot.org/story/10/08/08/226227/Claimed-Proof-That-P--NP?from=rss

If true, it'll mean that NP hard problems can't be solved in
polynomial time...  meaning amongst other things that modern ciphers
should remain effectively impossible (or rather incredibly
impractical) to decipher.

R.