Another Word For It Patrick Durusau on Topic Maps and Semantic Diversity

September 9, 2013

NSA:…bound by laws of computational complexity

Filed under: Cybersecurity,NSA,Security — Patrick Durusau @ 6:25 pm

NSA: Possibly breaking US laws, but still bound by laws of computational complexity by Scott Aaronson.

From the post:

Last week, I got an email from a journalist with the following inquiry. The recent Snowden revelations, which made public for the first time the US government’s “black budget,” contained the following enigmatic line from the Director of National Intelligence: “We are investing in groundbreaking cryptanalytic capabilities to defeat adversarial cryptography and exploit internet traffic.” So, the journalist wanted to know, what could these “groundbreaking” capabilities be? And in particular, was it possible that the NSA was buying quantum computers from D-Wave, and using them to run Shor’s algorithm to break the RSA cryptosystem?

I replied that, yes, that’s “possible,” but only in the same sense that it’s “possible” that the NSA is using the Easter Bunny for the same purpose. (For one thing, D-Wave themselves have said repeatedly that they have no interest in Shor’s algorithm or factoring. Admittedly, I guess that’s what D-Wave would say, were they making deals with NSA on the sly! But it’s also what the Easter Bunny would say.) More generally, I said that if the open scientific world’s understanding is anywhere close to correct, then quantum computing might someday become a practical threat to cryptographic security, but it isn’t one yet.

That, of course, raised the extremely interesting question of what “groundbreaking capabilities” the Director of National Intelligence was referring to. I said my personal guess was that, with ~99% probability, he meant various implementation vulnerabilities and side-channel attacks—the sort of thing that we know has compromised deployed cryptosystems many times in the past, but where it’s very easy to believe that the NSA is ahead of the open world. With ~1% probability, I guessed, the NSA made some sort of big improvement in classical algorithms for factoring, discrete log, or other number-theoretic problems. (I would’ve guessed even less than 1% probability for the latter, before the recent breakthrough by Joux solving discrete log in fields of small characteristic in quasipolynomial time.)

Scott goes on to point out that known encryption techniques, when used properly, put a major cramp on the style of data collectors. Why else would they be strong arming technology companies for back doors?

Solution? Make encryption the default and easier to use.

For example, email clients should come with default security (2048 bits anyone?) enabled and should store passwords to encrypt and decrypt. Bad security? You bet, but it does make it easier to use security for email across the Internet.

The more encrypted email that crosses the net, the more privacy for all of us.

Back doors? The only known solution for back doors is open source software.

No Comments

No comments yet.

RSS feed for comments on this post.

Sorry, the comment form is closed at this time.

Powered by WordPress