(AMS Bumper Sticker)



Web math-frolic.blogspot.com

Tuesday, September 10, 2013

P vs. NP vs. NSA


Since the press leaks regarding NSA subversion of online encryption through various means, dicey articles (and forum discussion) have begun speculating as to whether or not the agency may be working with a quantum computer, or even might have already proven P = NP (but for obvious reasons would never disclose such a proof -- cue in "Travelling Salesman" movie). Not much to back up such speculation… but always fun guessing, I s'pose. Here's one 'popular' piece (focused on RSA encryption, no actual mention of P vs. NP):

http://www.dailydot.com/politics/nsa-rsa-encryption-crack-prime-numbers/

And for those up to more of a challenge, here's a recent take from the always interesting, excellent Scott Aaronson:

http://www.scottaaronson.com/blog/?p=1517


No comments: