NSA Trying To Build Quantum Computer
New submitter sumoinsanity writes "The Washington Post has disclosed that the NSA is trying to build a quantum computer for use in cracking modern encryption. Their work is part of a research project into tackling the toughest equipment, which received $79.7 million in total funding. Another article makes the case that the NSA's quantum computing efforts are both disturbing and reassuring. The reassuring part is that public key infrastructure is still OK when done properly, since the NSA is still working so hard to defeat it. It's also highly unlikely that the NSA has achieved significant progress without outside awareness or help. More disturbing is that it may simply be a matter of time before it fails, and our private messages are out there for all to see."
Bitcoin mining.
Ok, 2 words.
It's a tool to help them justify congress how they can be spying on all Americans and not spying on any Americans at the same time.
For the peephole by the peephole.
That figure is so small vs total intelligence+defence budget that it'd be worth setting up a faux research effort just to give the misleading impression that they haven't yet developed something far better.
Come on... what's next? "NSA attempts to listen to other nation's communications"? That *is* their job, you know.
They've broken the law in letter and spirit. Let's try to keep the focus on that.
http://www.masturbateforpeace.com/
The disturbing part is not that the NSA might be able to listen to everyone's encryption someday. They are not an engineering organization and they will not be at the forefront of qubit manufacturing. The disturbing part is that they are wasting an enormous amount of taxpayer dollars on an impossible task aimed at ultimately destroying the ability to have security of any kind.
I sometimes ask revealing, often ignorant-seeming questions. Maybe they're harder to answer than you think.
NSA always will try to expand and it's stands to reason that the Chinese and their companies aren't under NSA sway, so the backdoors they build in are not under NSA control so the NSA has to try to crack them the hard way. In no way does it mean they don't have the US population under total surveillance.
"The reassuring part is that public key infrastructure is still OK when done properly, since the NSA is still working so hard to defeat it."
Unfortunately, 'when done properly' must include 'never using an American entity for key generation, storage, or distribution.' We have every reason to believe the NSA has muscled their way into possession of the master keys, Re: Lavabit. So if you're doing business with any type of PKI vendor who might be compelled to comply with a FISA court order, followed by a gag order, you might rethink it.
Remember when every browser in the world switched to the panic pages about a 'non-trusted' key?
Probably just a coincidence.
These are hardly shocking revelations. The document mentions to achieve control over two semiconductor qubits, whereas factoring 2048 bit numbers requires at least that many qubits, and probably several orders of magnitude more. The current record stands at control of 14 qubits, achieved in 2010 in Rainer Blatt's group at the University of Innsbruck, Austria, using trapped ions.
Some time ago, I wrote something on the history and possible future of quantum computing. Moreover, one also has to keep in mind that there are public key cryptosystems that most likely cannot be cracked even with quantum computers.
OS Reviews: Free and Open Source Software
No, see, I have just posted in a global warming thread. Someone went back and modded all my posts(just -1, no biggy), as a perfectly valid commentary on my opinions.
In *theory* they can match the values of an N bit code in one go where N is the number of quantum bits. In practice it might be another matter but even if not - that simply means you use more bits in your key. Once a quantum computer has used up all its bits it has to revert to working like a standard computer and doing everything serially. So if the quantum computer is N bits and we have a key with N + 32 bits the machine will still have to try 2^32 matches. So as quantum computer registers get larger so will encryption keys. Someone builds a 256 bit quantum computer? Great! So just use a 512 bit key and it'll have to do 2^256 comparisons. ie - it'll be damn slow.
...and my colleagues called me crazy when I gave them 256GB USB drives full of true randomly generated one-time pads to use to decrypt my emails because I didn't trust public key.
Who's crazy now! Muhahaha! (posted from secret volcano lair)
Not today. He was caught mass-modding people who disagree with him last night. All associated accounts were stripped of mod ability forever.
He will just make more, but he's dead in the water for a bit.
The NSA deserves a lot of criticism for some of the things they've been doing. However, this is the kind of thing they should be working on. It's not the tools they have that bothers me. It is how they use them that is the problem.
Proverbs 21:19
The NSA is supposed to be working on cryptography technology.
The NSA needs to get back to doing its job, and stop spying on Americans. We already have several branches of government that are responsible for domestic criminal investigations, and they're subject (in theory anyway) to the robust safeguards in the Constitution.
The NSA helps everyone with robust cryptography. It's in nobody's best interest when one government can decipher everyone else's communications, except maybe for that handful of codebreakers.
Regardless of what they say, terrorists are low tech. They do not have access to a large pool of cryptography talent, nor will they ever.
One NSA director in the 1960s said "I want a thousand-megacycle machine. I'll get you the money!" There's a book, "IBM's Early Computers", which shows much of NSA's exotic hardware from the 1950s through the early 1970s. High-density tape drives, the first automatic-changing tape library (TRACTOR), the first superscalar machine (STRETCH, which, for NSA, had a special crypto processor instead of an FPU), and a number of cyrogenic machines.
NSA tried hard to get cyrogenic computing to work, from the 1960s onward. They had some successes with getting devices to work fast in the 1960s, but the early superconducting devices were gated magnetically, which meant coils and discrite devices, not ICs. So they could be made fast, but not small, which means speed of light lag within the processor becomes a bottleneck. Mainstream CMOS IC technology eventually beat out the superconducting Josephson junction stuff on both price and speed. Some time in the 1980s, IBM and NSA gave up on that. It just wasn't a win over Moore's Law.
Quantum computing, though... Just maybe.
If I have a crack for a current cryptosystem, I'd still need to build a machine to address the next cryptosystem.
Remember the panic in Britain when the (WW2) German submarine service switched from 3-rotor to 4-rotor Enigma machines! They hadn't finished a "bombe" got 4-rotor machines, and only broke the 4-rotor code when they captured an undamaged 4-rotor machine.
That failure was one of the reasons behind building "Colossus", the first electromechanical computer. Colossus was eventually able to decrypt message from the Lorenz SZ40/42 12-wheel machines, which were much harder than the 4-wheel enigma.
davecb@spamcop.net
Has it actually been proven that it is mathematically impossible for a quantum algorithm to exist capable of defeating this system? I'm sure you could prove that any particular known algorithm wouldn't work, but the only system resistant to unknown algorithms that I'm aware of is the one-time pad.
If this has been proven I'm genuinely interested. I will confess I'm not a cryptographer.
I don't know about ring-learning-with-errors, but if it indeed reduces to an integer lattice problem, I suspect it would eventually prove to be vulnerable to some sort of attack that could be executed by a quantum computer.
As a silly example, here's a proposed attack on lattices that employs a quantum computer implementing a partial Grover's algorithm to speed up looking for solutions...
http://www.cdc.informatik.tu-darmstadt.de/reports/TR/TI-03-03.QSamplingPaper.pdf
As with many things, I doubt there is a negative proof. There's much about quantum computability that we do not understand yet (of course there is much about regular computability that we don't understand either, starting with P ?= NP). When people usually say it's resistant to quantum computers, they actually are implying that it's resistant to a quantum computer employing Shor's algorithm (and similar quantum fourier transform techiques) to factor large numbers and compute discrete logarithms (the basis behind the RSA and DH public key cryptosystems). There are other algorithms that quantum computer can run, most of which people have not even discovered yet.