Senior Contributing Editors:
Jesus Diaz
| AIM | Twitter
Mark Wilson, Reviews
| AIM | Twitter
Contributing Editors:
Matt Buchanan | AIM | Twitter
Adam Frucci | Twitter
Sean Fallon | Twitter
Jack Loftus | Twitter
John Herrman | Twitter
Dan Nosowitz
Chris Mascari
Danny Allen | Twitter
Rosa Golijan | Twitter
Chris Jacob
and yet, do you think this guy gets even close to all the poonanny he deserves? NO.
you'd think being a brilliant scientist on the cutting edge of quantum physics/computing that will likely usher in a new era of exponential crunching power that will save millions of lives through protein simulation and genetic analysis would get you some, but no. for that you need $500 sunglasses, a disposition of imposing, brutish ignorance, a german car, and huge lats. also, you have to dance and pluck your eyebrows.
@nutbastard: I'm not sure where you've been hanging out, but there are plenty of nerd-loving chicks in the Pacific Northwest. Thanks to Microsoft for that little culture shift.
im in san jose, where not only is the population 6:4 men to women, every other guy here is an engineer like myself - though usually better paid and with a college degree.
if i moved to alabama they'd herald me as a god damn genius. here in the valley, im just slightly under par.
This time next year, there will be a Java JVM for it and the Linux community will have made drivers to connect their peripherals. The interface will be clumsy and clunky until Apple comes in and makes it look great. Microsoft/Google will make cheaper versions that are just as good but slightly less pretty. Then, in about ten years, when the tech just starts to become truly ubiquitous, Giz will write an article declaring the tech "dead", and ushering in the rise of the next new tech that only a few early adopters are using.
Analysts refer to this phenomenon as "the circle of tech".
Apple will charge a kidney and a cornea for what is basically Linux.
Linux it's self will be compatible with more hardware only geeks use. But it will still get the best performance from the technology. Canonical will colour it all brown.
Microsoft will build a version that crashes constantly. Their EULA will also require your soul.
Google will re-brand the Linux version and use it to whore you to advertisers.
@OCEntertainment: Depending on where the first few quantum comps go, they are capable of brute force algorithm cracking every single password you use on the internet in seconds, vs the days/years crunching a modern quad core/array would take. Online banking, cyber warfare...these things tip the scales immensely.
@OCEntertainment: For one, there is a real possibility that with quantum computing we can make truly intelligent computers. I'm not afraid of a robot mutiny, but we would be stepping into a brave new world. Robots could potentially do every job on earth, from janitorial work, to automotive design. That's all science fiction, of course, but it could happen.
@ssaness: What I don't get is why passwords are so easy to launch a brute force attack on.
I mean, with every single password box, all you need to do is add a 1 second timer to it if someone types the wrong password, and that basically defeats all brute force attempts.
No one will complain that they have to wait 1 second between password attempts, and then computers can only throw out 1 guess/second, whereas current computers can do millions (billions?) of guesses/second.
It seems like an extremely simple solution to something that is a really big problem. Am I missing something really obvious, or did I just save everyone from disaster?
@psychiccheese You're awesome (: We're not talking about password boxes, unfortunately, or you'd be right. Any data sent over a secure protocol like SSL is encrypted using a cryptographic key. This is a mathematical process where you start with a bunch of 1's and 0's and end up with a new bunch.
If you are able to intercept that data, you can try as many times as you want, as quickly as you want to decrypt it.
There's no time limit on this either, so if a government has been keeping a library of intercepted communications, as soon as new tools become available, they can unlock it.
@jetRink: Hmm... didn't think of that. But wouldn't breaking the decryption key through brute force take longer than trying every possible password? Or is it the exact same thing, since they'd have the public encryption key anyways.
But I'm sure there's some situations where password boxes could benefit from a small delay, just not nearly as many as I first thought.
@psychiccheese You're awesome (: If you want to compare vulnerabilities, you have to be more specific about what you are defending against. If you want to protect a server from unauthorized access, a delay or attempt limit is a great idea.
If you want to keep data protected from prying eyes on its trip between the server and the client, you need to rely on encryption. The key used will be a randomly generated number and will always be different than the one used to log in.
It should also be noted that not every kind of computational problem can be solved efficiently using quantum computers.
It's even been shown that for certain classes of problems, *emulating* quantum computing on a regular processor is faster.
As with most things - it's not an either/or situation, it's an also/and situation. Current technology (or some future analogy of it) will be with us for a LONG time.
Quantum computers really aren't fundamentally much better at solving the problems your computer spends the vast majority of its time working on. Without getting into a discussion of computational complexity theory, where quantum computers really shine is in a class of problems called Nondeterministic Polynomial time (NP). Basically, these are problems where the only possible way to solve them in an ordinary computer is to check every possible answer one by one until you find one that fits.
Ordinary computers solve problems by breaking them down into tiny pieces and working on each piece one at a time. There is no problem they can't solve given enough time- bigger, harder problems just get turned into more pieces and take more time to finish.
Quantum computers, on the other hand, work best when you don't break down the problems. If you have a computer with enough qubits to describe the entire problem, then it can check every possible answer at the same time. This only works if the computer has enough qubits for the entire problem, but its a lot faster than trying each answer one-by-one.
For NP problems, this can mean the difference between being done in an instant versus waiting a few billion years. But for most problems, there are much better ways to solve them with ordinary computers, and quantum computers don't really offer a lot of advantage.
I expect when quantum computers start getting into the hundreds of reliable qubits, the government will take up an intense interest in the research and keeping it away from everybody else. Many billions will be spent so that the NSA can easily break everybody's codes, and nobody else can. Codebreaking is really the only obvious application for quantum computers under 100K qubits. After that breaks down and we get into the millions of qubits, certain major corporations will start getting one or two- Google for search algorithms, UPS for route planning (no, really), etc. Maybe someday (not in the next 25 years) we'll see them as secondary processors (a QPU?). I doubt if they will ever primary means of computation, though. For non-NP problems, they're just not worth the trouble.
@XandraMuses: Nicely explained, as NP problems are everywhere. For those who don't understand, NP problems are ones that can't be described by a polynomial time relation, such as x^2 + 3x + 1. They deal more with permutations and combinations. For example, say you have to assign 300 students to 300 lockers with stipulating conditions such as certain students can't be by each other, some must be in a certain number range, etc. The only way computers can solve these is by guessing and checking, there's no efficient way to do it, and moreover, guaranteeing an optimal solution is even worse.
11/18/09
Seams we are headed to the dark ages again. I'll keep all my P III processors, seams they can work fine for me.
^__^
11/18/09
you'd think being a brilliant scientist on the cutting edge of quantum physics/computing that will likely usher in a new era of exponential crunching power that will save millions of lives through protein simulation and genetic analysis would get you some, but no. for that you need $500 sunglasses, a disposition of imposing, brutish ignorance, a german car, and huge lats. also, you have to dance and pluck your eyebrows.
11/18/09
11/18/09
careful, that works on a bell curve.
im in san jose, where not only is the population 6:4 men to women, every other guy here is an engineer like myself - though usually better paid and with a college degree.
if i moved to alabama they'd herald me as a god damn genius. here in the valley, im just slightly under par.
11/18/09
NOW GET OFF MY LAWN.
11/18/09
Analysts refer to this phenomenon as "the circle of tech".
11/18/09
Apple will charge a kidney and a cornea for what is basically Linux.
Linux it's self will be compatible with more hardware only geeks use. But it will still get the best performance from the technology. Canonical will colour it all brown.
Microsoft will build a version that crashes constantly. Their EULA will also require your soul.
Google will re-brand the Linux version and use it to whore you to advertisers.
11/18/09
^__^
11/18/09
11/18/09
11/18/09
11/18/09
11/18/09
11/18/09
I mean, with every single password box, all you need to do is add a 1 second timer to it if someone types the wrong password, and that basically defeats all brute force attempts.
No one will complain that they have to wait 1 second between password attempts, and then computers can only throw out 1 guess/second, whereas current computers can do millions (billions?) of guesses/second.
It seems like an extremely simple solution to something that is a really big problem. Am I missing something really obvious, or did I just save everyone from disaster?
11/18/09
If you are able to intercept that data, you can try as many times as you want, as quickly as you want to decrypt it.
There's no time limit on this either, so if a government has been keeping a library of intercepted communications, as soon as new tools become available, they can unlock it.
11/18/09
But I'm sure there's some situations where password boxes could benefit from a small delay, just not nearly as many as I first thought.
11/18/09
11/18/09
If you want to keep data protected from prying eyes on its trip between the server and the client, you need to rely on encryption. The key used will be a randomly generated number and will always be different than the one used to log in.
11/18/09
11/18/09
I smell a new civil rights movement.
11/18/09
11/18/09
11/18/09
11/18/09
11/18/09
11/18/09
I am a little disappointed in the lack of giant switches.
08/20/09
08/20/09
Oh yeah, and Crysis freezes.
08/20/09
08/19/09
It's even been shown that for certain classes of problems, *emulating* quantum computing on a regular processor is faster.
As with most things - it's not an either/or situation, it's an also/and situation. Current technology (or some future analogy of it) will be with us for a LONG time.
08/19/09
Ordinary computers solve problems by breaking them down into tiny pieces and working on each piece one at a time. There is no problem they can't solve given enough time- bigger, harder problems just get turned into more pieces and take more time to finish.
Quantum computers, on the other hand, work best when you don't break down the problems. If you have a computer with enough qubits to describe the entire problem, then it can check every possible answer at the same time. This only works if the computer has enough qubits for the entire problem, but its a lot faster than trying each answer one-by-one.
For NP problems, this can mean the difference between being done in an instant versus waiting a few billion years. But for most problems, there are much better ways to solve them with ordinary computers, and quantum computers don't really offer a lot of advantage.
I expect when quantum computers start getting into the hundreds of reliable qubits, the government will take up an intense interest in the research and keeping it away from everybody else. Many billions will be spent so that the NSA can easily break everybody's codes, and nobody else can. Codebreaking is really the only obvious application for quantum computers under 100K qubits. After that breaks down and we get into the millions of qubits, certain major corporations will start getting one or two- Google for search algorithms, UPS for route planning (no, really), etc. Maybe someday (not in the next 25 years) we'll see them as secondary processors (a QPU?). I doubt if they will ever primary means of computation, though. For non-NP problems, they're just not worth the trouble.
08/19/09
08/19/09
My cats are wondering why quantum physics is so predisposed to locking felines in boxes with uranium atoms and poison gas.
08/19/09
i wonder if his cat survived, who could stand the curiosity of not knowing if his cat was alive or dead...
08/19/09
08/19/09
08/19/09