While it currently operates at a the level of a below-average 4th grader, a new quantum computer designed by researchers at UCSB may provide the framework for revolutionizing the data-encryption process.
Researchers at UCSB have designed a quantum computer capable of factoring numbers into their primes — an integral part of cryptography and cyber security, according to the researchers’ recent paper in Nature Physics. While its future implications are great, the project is in its fledgling stages; during 150,000 trials, UCSB’s first quantum processor succeeded in correctly determining that 15 factored into 3 times 5 approximately half of the time.
Although one out of two is a measly success rate even for a slide rule, the solid-state quantum processor is running a version of Peter Shor’s prime factoring algorithm, a complex mathematical process for breaking down numbers that, in theory, is correct exactly 50 percent of the time.
As it happens, determining the prime factors of the number 15 is not a bad starting point. With some refinements, and applied on a bigger scale in a bigger machine, the quantum processor could be capable of deciphering even the largest of numbers, like the 600-digit-plus strings sometimes used in RSA encryption, the most prevalent form of data encoding. According to Erik Lucero, lead author of the researchers’ paper, a standard computer and classical algorithms could factor the RSA Laboratory’s largest number — but it would take longer than the age of the universe to do so. An appropriately large quantum computer armed with Shor’s algorithm, Lucero says, could crack that number in a matter of minutes. Lucero, a former doctoral student in physics at UCSB, is now an experimental quantum computing researcher at IBM.
If such a processor enters the market, traditional encrypting will be forced to change completely. According to Lucero, the quantum processors power can be used for both sides of the process, allowing “quantum cryptography” to replace traditional RSA. Quantum encrypting would be more difficult to crack and far easier to keep secure — Lucero says quantum cryptography systems immediately notify both user and potential intruder when the system has been tampered with. For example, Lucero said a voice conversation over quantum encrypted lines would immediately become “jumbled” when a third party attempted to access the system.
For now, the researchers’ tests have shown that their theory and design are sound, and the quantum computer has the potential to crack harder numbers better, faster, and stronger than any system before it.


Print friendly
E-mail story
Tip Us Off
Comments
Share Article
Myspace





Previous Month



Comments
This reminds me of the story of mathematician Frank Nelson Cole who dedicated "three years of Sundays" to this endeavor:
http://www.paulrutherford.com/coachai...
EastBeach (anonymous profile)
August 26, 2012 at 2:43 p.m. (Suggest removal)
The "encrypters" are always one step ahead of the "decrypters". There is now a basis for an encryption scheme that even theoretically cannot be broken; it does not depend on determining prime factors. It won't matter how powerful a computer is used when such a scheme is implemented.
Some nitpicks about the article. First, regarding the first paragraph, UCSB is working on a decryption scheme, not an encryption scheme. Second, the reference to slide rules is a bit inane. One cannot do factorization with a slide rule.
SezMe (anonymous profile)
August 27, 2012 at 12:47 a.m. (Suggest removal)
SezMe's nitpicking deserves a nitpickier response! :-)
The article's first paragraph didn't say UCSB was working on an encryption scheme - it said the work "may provide the framework for revolutionizing the data-encryption process". I'd say that a more powerful decryption scheme would certainly lead to a revolution in encryption! Perhaps in the way you referred to in your first paragraph, which it would be nice if you'd provide a keyword for so we learn more about it.
SBSB (anonymous profile)
August 27, 2012 at 10:34 a.m. (Suggest removal)
From the non nitpicky point of view: UCSB is ranked number one in the WORLD in computational ability. While other institutions may rank higher in computer science, sometimes due to the fact that all of their grads get hired by Google etc., in basic capability our local institution is at the top.
italiansurg (anonymous profile)
August 27, 2012 at 11:21 a.m. (Suggest removal)
SBSB, see here:
http://en.wikipedia.org/wiki/One-time...
Your first nit is correct; I oversimplified.
SezMe (anonymous profile)
August 27, 2012 at 3:19 p.m. (Suggest removal)