Slashdot Mirror


MIT's New 5-Atom Quantum Computer Could Make Today's Encryption Obsolete (pcworld.com)

An anonymous reader writes: In traditional computing, numbers are represented by either 0s or 1s, but quantum computing relies on atomic-scale units, or "quibits," that can be simultaneously 0 and 1 -- a state known as a superposition that's far more efficient. It typically takes about 12 qubits to factor the number 15, but researchers at MIT and the University of Innsbruck in Austria have found a way to pare that down to five qubits, each represented by a single atom, they said this week. Using laser pulses to keep the quantum system stable by holding the atoms in an ion trap, the new system promises scalability as well, as more atoms and lasers can be added to build a bigger and faster quantum computer able to factor much larger numbers. That, in turn, presents new risks for factorization-based methods such as RSA, used for protecting credit cards, state secrets and other confidential data. "If you are a nation state, you probably don't want to publicly store your secrets using encryption that relies on factoring as a hard-to-invert problem," said Chuang. "Because when these quantum computers start coming out, [adversaries will] be able to go back and unencrypt all those old secrets."

179 comments

  1. Quantum computers were "5 years away"... in 1972! by Anonymous Coward · · Score: 1, Insightful

    Way back in 1972, before many Slashdotters were even born, I remember hearing about how quantum computers were just "5 years away".

    Then in 1977, I remember hearing about how quantum computers were just "5 years away".

    Then in 1982, I remember hearing about how quantum computers were just "5 years away".

    Then in 1987, I remember hearing about how quantum computers were just "5 years away".

    Then in 1992, I remember hearing about how quantum computers were just "5 years away".

    Then in 1997, I remember hearing about how quantum computers were just "5 years away".

    Then in 2002, I remember hearing about how quantum computers were just "5 years away".

    Then in 2007, I remember hearing about how quantum computers were just "5 years away".

    Then in 2012, I remember hearing about how quantum computers were just "5 years away".

    I have a strong suspicion that in 2017 I will be hearing about how quantum computers are just "5 years away".

  2. gotta get the encrypted data first by Anonymous Coward · · Score: 1

    You first have to get a copy of the encrypted data before you can start trying to hack it. Are there any governments that actually store their state secrets in a fashion where they rely purely on encryption? Encryption tends to be an extra layer.

    1. Re:gotta get the encrypted data first by dohzer · · Score: 1

      Which is exactly what the summary says: "you probably don't want to publicly store your secrets".

    2. Re:gotta get the encrypted data first by Anonymous Coward · · Score: 0

      regardless of whether quantum computing existed (and this is massively overhyped as they are no where near working out a scalable way to crack encryption using quantum computing) nation states don't store this stuff online so why the fuck does the article or author make such a stupid statement. There is no "probably" don't, they simply DO NOT, have NEVER done nor would they likely EVER. hacking aside, leaking a key is a real threat and much easier than cracking encryption so I don't know of any nation that would even consider this.

    3. Re:gotta get the encrypted data first by Hylandr · · Score: 2

      "Don't publicly store your secrets".

      FTFY

      --
      ~ People that think they are better than anyone else for any reason are the cause of all the strife in the world.
    4. Re:gotta get the encrypted data first by HiThere · · Score: 1

      The problem is that to be accurate you should have said "nation states shouldn't store this stuff online". But we keep running across stories of where one or the other has done so. Not frequently, but often enough. Perhaps once every other year. And those are the occasions we hear about.

      Now aside from this there are all those occasionally lost laptops or hard disks that are sold without reformatting or...

      People aren't perfect. Mistakes happen. And secrets occasionally get published...sometimes even unencrypted. But if they are stored securely encrypted, then it takes an extra layer of mistakes to reveal them. This is just saying not to count on prime factoring for that extra layer. I'm not really sure it's correct except for something like transmission of public-key handshakes, but it's not an area where I'm really knowledgeable.

      The thing is, quantum computing isn't some sort of magic wand, it merely (in this application) decreases the number of steps necessary to decrypt something. But if the quantum computer takes a lot longer for each step, then it may not be much of an improvement. And it's sure to need a lot more error correction. So a longer key might suffice. Perhaps. We don't know how this will develop, but not all computer technologies end up being fast. And the description doesn't lead me to expect this approach to ever be cheap.

      --

      I think we've pushed this "anyone can grow up to be president" thing too far.
    5. Re:gotta get the encrypted data first by Anonymous Coward · · Score: 0

      ctiations please. Would love some pointers to such articles. I have seen a lot of private and confidential stuff that they shouldn't have stored online and have, not aware of any articles about nation secrets that have been ound to be stored online.

    6. Re:gotta get the encrypted data first by currently_awake · · Score: 4, Interesting

      Governments, corporations, and groups of people need to communicate securely. Quantum crypto breaking destroys the one way math based crypto systems but other systems still exist and will still be secure. Given the low cost of bulk data storage we might consider moving to one time pads.

    7. Re:gotta get the encrypted data first by Hylandr · · Score: 0

      Assuming of course the concept of "Quantum Computing" proves it's legitimacy and this hypothetical scenario could be implemented with a suitable number of bits to work with.

      Until proven otherwise I am lumping all near-magical claims of quantum-super-computing the same status of Alchemy in the medieval era of bilking governments for money and jobs.

      --
      ~ People that think they are better than anyone else for any reason are the cause of all the strife in the world.
    8. Re:gotta get the encrypted data first by KGIII · · Score: 1

      I am a mathematician but I am not a cryptologist, not even remotely. I am also a bit of a geek with some extensive computer knowledge that includes things like securing (hardening really, nothing is ever secure so long as it is functional) computers and networks, though such was a matter of necessity and not an academic pursuit.

      One of the things that has intrigued me is how, exactly, we'll be able to secure our data once quantum computing becomes widely available at reasonable costs. I've read a few papers about how we can (maybe!) ensure an uninterrupted stream, for example. Yet, not long after reading any of those papers, I return to them thinking that there's probably going to be a way around those checks.

      I've pondered the math that's going to need to be done, I'm not a theoretical maths type of guy and prefer more practical applications for my own needs, and I'm really not sure how we're going to be able to do it unless we're truly able to achieve true-random. (And I do not mean pseudo-random, it's a bit philosophical.) I'm not sure that I haven't overlooked something, I am not a crypto-geek. However, it's fine mental bubble-gum.

      --
      "So long and thanks for all the fish."
    9. Re: gotta get the encrypted data first by Anonymous Coward · · Score: 0

      opam being hosed for starters.

      computers should not be used for secret information. period.

      use paper files and a safe.

      yeah, i have a degree in computer science.

      and i can parse hillary clinton and carly fiorina.

    10. Re:gotta get the encrypted data first by KGIII · · Score: 1

      Hmm... As I mentioned in an above post, one of the things that I've read was a paper that did indicate some value. In theory, at least, one can use quantum computing to ensure there's no MitM attack/interception. So, the communication (as a process) might be secured.

      --
      "So long and thanks for all the fish."
    11. Re: gotta get the encrypted data first by Anonymous Coward · · Score: 0

      errara: OPM.

    12. Re:gotta get the encrypted data first by TechyImmigrant · · Score: 2

      >how, exactly, we'll be able to secure our data once quantum computing becomes widely available

      Look here

      Summary..
      Encryption and symmetric signing will need to double the key size for the same security bound.
      RSA, ECDH and ECDSA will be insecure.

      So key management goes back to the pre-DH days.

      --
      I should use this sig to advertise my book ISBN-13 : 978-1501515132.
    13. Re:gotta get the encrypted data first by kwbauer · · Score: 1

      internet search with the following keywords: Hillary, emails

    14. Re:gotta get the encrypted data first by Bob+the+Super+Hamste · · Score: 1

      Also NIST wanted 256 bit keys for all entrants into the AES competition for that exact reason so AES, SERPENT, and TWOFISH should all be ok unless there is a break that is discovered in any of them and then you would be screwed

      --
      Time to offend someone
    15. Re:gotta get the encrypted data first by Bob+the+Super+Hamste · · Score: 1

      For Public key crypto there is still Lattice-based crypto which so far does not have a break on either a classical or quantum computer. For symmetric key (AES, SERPENT, TWOFISH) schemes they will still be good, but only use the 256 bit key versions as that puts the lower bounds on energy requirements to crack them near the total output of the Sun over its entire lifetime even on a quantum computer. Yes quantum computers can do some things amazingly fast but for symmetric key crypto the work is changed from 2^N to 2^(N/2), where N is the key size, which for good key sizes puts it beyond the abilities of even ideal quantum computers we could build in this solar system.

      --
      Time to offend someone
    16. Re:gotta get the encrypted data first by macs4all · · Score: 1

      Also NIST wanted 256 bit keys for all entrants into the AES competition for that exact reason so AES, SERPENT, and TWOFISH should all be ok unless there is a break that is discovered in any of them and then you would be screwed

      Yes, but isn't AES 256 actually weaker than AES 128?

      Disclaimer: I am in no way a cryptologist, or a math expert

    17. Re:gotta get the encrypted data first by HiThere · · Score: 1

      A problem is that even for a theoretically perfect solution, you are depending on a perfect implementation. Recently most cryptographic problems have stemmed from faulty implementation, and the more complicated something gets, the more likely the implementation will be faulty.

      But the real answer seems to be "if you want a secret to be secure, don't share it". There always seems to be some way to discover a shared secret.

      --

      I think we've pushed this "anyone can grow up to be president" thing too far.
    18. Re:gotta get the encrypted data first by delt0r · · Score: 1

      First note that quantum computers that can even think about cracking the current crop of encryption are *thousands of qubits away*. Not 5. Quantum computers are exponentially difficult to build. And a 1000bit quantum computers is 100% totally absolutely useless for a job that requires 1001qbits. Also that 1 extra bit makes it about 2 times harder to build. We are talking about a rock abacus compared to a modern 15nm process CPU/GPU here.

      Next note that it has no real effect on symmetric encryption. Also there are signature schemes that are also 100% based on hash functions, that quantum computers are no better at dealing with. Finally there are public key methods that quantum computers cannot break. They have large keys, but we are not on 9600baud rate modems anymore.

      The main threat to security will be the same as it is now. Bad implementations and sloppy processes.

      --
      If information wants to be free, why does my internet connection cost so much?
    19. Re:gotta get the encrypted data first by delt0r · · Score: 1

      There are quantum resistant signing and public key methods. So no. It won't be pre DH days.

      --
      If information wants to be free, why does my internet connection cost so much?
    20. Re:gotta get the encrypted data first by Hylandr · · Score: 1

      I would be more interested in using something like that to communicate from one side of the solar system to the other or further yet without the restriction of the speed of light on the propagation of radio waves.

      --
      ~ People that think they are better than anyone else for any reason are the cause of all the strife in the world.
    21. Re:gotta get the encrypted data first by Bob+the+Super+Hamste · · Score: 1

      From reading that it would appear that the problem is that the key schedule in AES 256 is substantially worse than the one used in AES128. So yes it would appear to be weaker. Also it would seem that cracking AES256 is the holy grail as it is the standard and was pushed so hard so it has a rather large target on it while AES 128 and AES 192 have been ignored more since they are likely less used. Personally I wouldn't recommend using AES 128 in hopes of it preventing attack from quantum computers as it would likely only be slightly stronger than DES is against classical computers. From what I have read on the various AES ciphers the best one to use still looks like it is SERPENT even if it isn't as fast as AES or TWOFISH.

      I'm not a cryptologist either but is someone who is a motivated amateur. The math for ciphers isn't that difficult to understand if you find a good source to walk you through the beginnings. For getting started with it I found this site to be helpful.

      --
      Time to offend someone
    22. Re:gotta get the encrypted data first by TechyImmigrant · · Score: 1

      There are. They don't have a great history of remaining either unbroken very long, unencumbered by patents or having key sizes that are reasonable.

      However a remain a skeptic on effective factoring or DLP breaking quantum computers happening. I will stick to working to solve the much more immediate problems of crypto - weak RNGs, excess complexity in protocols, untrustable curves, fragile PKI models and clonable identities. There's plenty of time to fix those before physicists can build a freezer cold enough to entangle enough bits to make a decent crack at current public key algorithms.

      --
      I should use this sig to advertise my book ISBN-13 : 978-1501515132.
    23. Re:gotta get the encrypted data first by delt0r · · Score: 1

      They don't have a great history of remaining either unbroken very long, unencumbered by patents or having key sizes that are reasonable.

      Yes they do. Lamport signature and extensions (merkel etc) are totally secure as long as the hash function is secure. And McEliece has been around a long time and not been broken. Neither has patents. So no idea what your talking about.

      --
      If information wants to be free, why does my internet connection cost so much?
    24. Re:gotta get the encrypted data first by TechyImmigrant · · Score: 1

      Wild McEliece was broken as were several other variants. That's a reason to suspect McEliece won't survive very long

      The most important problem to solve it key agreement protocols based on public key crypto to replace DH and RSA if quantum computers become practical. Hashes just need to increase their output size. So signing isn't a big problem and Merkel trees are thus fine.

      However Lamport keys are around 128Kibits each, so a key pair is 256Kibits. So the key size is not reasonable.

      --
      I should use this sig to advertise my book ISBN-13 : 978-1501515132.
    25. Re:gotta get the encrypted data first by delt0r · · Score: 1

      Its not 1980s anymore. We are not on 9600 baud rate modems. Hell i was offered 10GBit fiber for my domestic internet just yesterday, the server farm i am looking uses 100Gbit! I have over 10T of disk space on my desk. Also there are schemes to reduce key size and sig size in Lamport. Finally McEliece with Goppa codes is old and hasn't been broken and lots of people have been trying recently (lots of papers in the last few years) as well, there is even now a signature scheme using it. Not sure where you keep up with this stuff. Since there have been broken variants of both DH/RSA and ECC we should just assume they are also weak? Yea ya not making much sense.

      --
      If information wants to be free, why does my internet connection cost so much?
    26. Re:gotta get the encrypted data first by TechyImmigrant · · Score: 1

      Try implementing these things in power efficient hardware. Huge keys suck both from an efficiency point of view and a side channel point of view.

      --
      I should use this sig to advertise my book ISBN-13 : 978-1501515132.
    27. Re:gotta get the encrypted data first by delt0r · · Score: 1

      We have. The shit cheap chip cards struggle with any real security anyway. Yea who knew that if you be cheap you get cheap security. I worked on some 12 odd years ago, i was on contract with a different system a month or so ago, and you know what. The performance hasn't increased at all. However the memory had, and you know what, McEliece is faster than even ECC. So ECC was out, too slow. In the end we went for a shared secret key. Not much choice for how fast the thing was suppose to work.

      And well it is irrelevant anyway. That is your choice, or go invent a public key system that uses mere bytes for keys and sigs, but somehow requires 2^256 operations to break without the secret. since that seems to be the only thing your interested in. And like i said shit chips give shit security. They are often very insecure because the vendor insists on the 50c per card option rather than the $2 per card. Like the US is just only moving past mag stripe. Clearly none of these decisions are about real security.

      --
      If information wants to be free, why does my internet connection cost so much?
    28. Re:gotta get the encrypted data first by RespekMyAthorati · · Score: 1

      Or let Hillary anywhere near it.

  3. Call me when you can factor a 2048 bit key by Anonymous Coward · · Score: 0

    I can factor 15 as well, in my head, near instantly. The only speed problem is I/O.

    Yes, this MIGHT be a threat to encryption systems one day, might not as well.

    1. Re: Call me when you can factor a 2048 bit key by Anonymous Coward · · Score: 0

      its only 5 years away.

    2. Re: Call me when you can factor a 2048 bit key by Anonymous Coward · · Score: 0

      That's what you said 5 years ago!

    3. Re: Call me when you can factor a 2048 bit key by Anonymous Coward · · Score: 0

      You're such a caveman. It will happen and in our lifetimes to boot. Today's technology will look like the typewriter does to us today in the next century. I can't fathom how so many of you think we are nearing a peak and slowing down and that tomorrows tech won't be very much more advanced than the childs toys (super computers) we are playing with today that we believe are so advanced.

    4. Re: Call me when you can factor a 2048 bit key by Anonymous Coward · · Score: 0

      yes, its still only 5 years away.

      no one ever said "from when"

  4. Unencrypt? by wodencafe · · Score: 0

    Surely they mean Decrypt, right? I mean, these are supposed to be the best and brightest, MIT "creme de la creme", right?

    1. Re:Unencrypt? by Anonymous Coward · · Score: 2, Insightful

      Surely they mean Decrypt, right? I mean, these are supposed to be the best and brightest, MIT "creme de la creme", right?

      Isaac Chuang is professor of physics and professor of electrical engineering and computer science at MIT. He is NOT professor of English at MIT. So step the fuck off, Chris Boyd. And stop unnecessarily capitalizing your Ds.

    2. Re:Unencrypt? by Anonymous Coward · · Score: 0

      Yes, us round-eyes better start getting used to Chinglish and translating it on the fly...

    3. Re: Unencrypt? by Anonymous Coward · · Score: 0

      Luckily we'll have those quantum computers coming to do that for us

    4. Re: Unencrypt? by Anonymous Coward · · Score: 0

      Fuck chuang, if he has a degree in CS he should know that it's decrypt and not unencrypt. Fuck him and fuck you for defending his fuck up.

      An English degree shouldn't be needed to know the correct terms in your field of study.

  5. Re:Quantum computers were "5 years away"... in 197 by 50000BTU_barbecue · · Score: 4, Funny

    Now they're just 5 atoms away.

    --
    Mostly random stuff.
  6. Irrelevant for AES, Serpent, Twofish... by Anonymous Coward · · Score: 0

    Totally irrelevant versus symmetric encryption (private key only). At least the summary makes this somewhat clear. This is a threat (and a known one) to at most public key methods and probably public key methods that rely on certain one way functions. Not going to fuck with, say, Truecrypt/Veracrypt/LUKS.

    1. Re:Irrelevant for AES, Serpent, Twofish... by AchilleTalon · · Score: 1

      Yep, but public key encryption is the method needed to exchange keys to setup symmetric encryption between two parties. So, if you can decrypt the initial exchange, you can grab the private keys for the symmetric encryption.

      --
      Achille Talon
      Hop!
    2. Re: Irrelevant for AES, Serpent, Twofish... by Anonymous Coward · · Score: 0

      oh boy. how they tortured your mind.

      wean yourself off the mainstream ideologies and learn to use things like postal mail and petrol powered carriages.

      most importantly USE BRAIN.

    3. Re:Irrelevant for AES, Serpent, Twofish... by EndlessNameless · · Score: 1

      If your full-disk encryption protects the symmetric volume key using certificates (e.g., users with Smart Cards), then you are still vulnerable.

      There are a lot of use cases where symmetric keys are protected or transferred using asymmetric encryption, so breaking RSA will have far-reaching consequences.

      Your personal workstation is probably not one of those cases. That doesn't mean it isn't a big deal for everyone regardless.

      --

      ---
      According to the latest ruleset, this post should be modded as Vorpal Flamebait +5.
  7. Totally misleading title by AchilleTalon · · Score: 2, Interesting
    Factorization of the number 15 won't render modern encryption obsolete at all. To rendre encryption obsolete, they will need much more than 5 atoms and be able to factorize much more larger numbers.

    Seriously /., you are insulting to the community.

    --
    Achille Talon
    Hop!
    1. Re:Totally misleading title by PPH · · Score: 1

      the number 15

      You managed to crack my luggage combo, insensitive clod!

      --
      Have gnu, will travel.
    2. Re:Totally misleading title by AmazingRuss · · Score: 1

      Luckily, this univers is chock FULL of atoms. All we could possibly need!

    3. Re:Totally misleading title by fahrbot-bot · · Score: 3, Funny

      Luckily, this univers is chock FULL of atoms. All we could possibly need!

      But it's, apparently, short on "e"s. :-)

      --
      It must have been something you assimilated. . . .
    4. Re:Totally misleading title by HiThere · · Score: 1

      They explicitly talked about it being scalable. But I do wonder what amount of error correction will be needed as they increase the length, and, of course, about the speed and the cost.

      I have my doubts about this particular approach ever being practical (as in a reasonable degree of accuracy on a reasonable problem at a reasonable cost). Of course, but different applications reasonable will have a different value, but still...

      This looks to me like another laboratory benchtop quantum computer, slightly more practical than the one based around a cup of coffee. It may be something that can be developed into something practical, but the development won't be straightforwards.

      --

      I think we've pushed this "anyone can grow up to be president" thing too far.
    5. Re:Totally misleading title by 93+Escort+Wagon · · Score: 1

      I've got extras - take what you need. eeeeeeeeeeeeeeeeeee

      --
      #DeleteChrome
    6. Re:Totally misleading title by Jason+Levine · · Score: 5, Funny

      Much apprciatd. My own storag of 's was gtting dangrously low. I trid to buy thm from an onlin sourc, but that sal fll to pics. Who knw it would b so hard to locat a vndor to purchas xtra 's from?

      --
      My sci-fi novel, Ghost Thief, is now available from Amazon.com.
    7. Re:Totally misleading title by Anonymous Coward · · Score: 0

      Sure, but going from 5 to a few hundred, or a few thousand, doesn't seem like an impossibility.

    8. Re:Totally misleading title by abies · · Score: 1

      Sure, but going from 5 to a few hundred, or a few thousand, doesn't seem like an impossibility.

      Think about juggling knives. There is plenty of people who can do 5. There are some which can do 7. Will you assume that going to hundreds or few thousand doesn't seem like an impossibility?

    9. Re:Totally misleading title by butzwonker · · Score: 1

      It's great that there are so many experts on quantum encryption on /. Where else could I get reliable information about it?

    10. Re:Totally misleading title by Anonymous Coward · · Score: 0

      You can have your coffee based tech, but personally I'm waiting for the tea based tech. Especially the stuff that needs a really hot cup of tea.

    11. Re:Totally misleading title by bfpierce · · Score: 1

      1.) It says could, not will.

      2.) Says right in the article that this particular design holds some promise on scalability.

      3.) Poor reading comprehension skills is just insulting to our entire species at this point.

    12. Re:Totally misleading title by Anonymous Coward · · Score: 0

      Where were you in 2013? You could have saved us from the Helium shortage with all those "e"s.

    13. Re:Totally misleading title by silentcoder · · Score: 1

      As I recall the last piece of technology documented to require a hot cup of tea was the infinite improbability drive, which while capable of revolutionizing space travel, was not exactly a computational device.

      --
      Unicode killed the ASCII-art *
    14. Re:Totally misleading title by silentcoder · · Score: 1

      And just what exactly about atoms make you think that shining some lasers on them is anything like juggling knifes ?

      --
      Unicode killed the ASCII-art *
    15. Re:Totally misleading title by dave420 · · Score: 1

      Incorrect. You are thinking of the Bambleweeny 57 Submeson Brain. Your geek card has been revoked :)

    16. Re:Totally misleading title by abies · · Score: 1

      In the way that keeping them in proper state/entanglement/whatever gets more complex - like adding more knives for a single juggler, rather than adding new jugglers next to each other, each handling independent, small set of knives.

    17. Re:Totally misleading title by Anonymous Coward · · Score: 0

      I cn swp you ll the e's you wnt s long s you cn provide me with supply of 's. I rn out lte lst yer.

    18. Re:Totally misleading title by Anonymous Coward · · Score: 0

      Nope, you can melt plastic with a hot cup of tea and make your own Babbage.

    19. Re: Totally misleading title by silentcoder · · Score: 1

      That is some seriously hot tea. Superheated in fact. Better be carefull...

      --
      Unicode killed the ASCII-art *
  8. Quantum computers won't break RSA by ffkom · · Score: 4, Insightful

    I am still pretty convinced that the "quantum computer"-hype is based on fundamentally flawed assumptions, and that they won't break RSA (or other practical problems) of any reasonable size, that are not also easily solved with conventional computers.

    Just because a model works with probabilities of "uncertain states" does not mean reality will reveal a "solution" based on all possible combinations of such states in no time. There is no compelling evidence yet that a quantum computer will find solutions quicker than it takes the real, physical hardware of that computer to take on all relevant input state combinations.

    I'm prepared to bet the safety of my encrypted data on that, and I am convinced that 40 years from now, we'll look back at the hype around quantum computers the same way we today look back on the era of analog computers in the 1960s/1970s, when it was a plausible approach to solve some (back then hard-to-compute-digitally) equations, like for numerical calculus, by building physical systems (electronic circuits) that were known to behave in a way that equations could be solved by carefully adjusting some input voltages, then measuring some output voltage. We know that the precision achievable by such analog computers is very limited, and see the same problem preventing "quantum computers" from ever providing solutions that need to process a significant amount of information.

    1. Re:Quantum computers won't break RSA by ortholattice · · Score: 4, Informative

      While you could be right that the necessary technology still won't be available in 40 years, the quantum world is fundamentally different from the analog world. In the analog world, noise and other errors determine an absolute limit as to how much precision you can achieve. In the quantum world, there is the miracle of quantum error correction that can compensate for errors. It is quite amazing mathematically that linear transformations performed by quantum gates can correct errors, but the mathematics works (I have worked through it myself, it's not terribly hard, requiring only linear algebra) and small error-correcting qubit circuits have been demonstrated.

      Most important is the threshold theorem that says if we can reduce the noise in a qubit below about 1 part in 10^5 (IIRC), error correction can allow a quantum computer to grow to an unlimited number of qubits. That's when the revolution will start.

    2. Re:Quantum computers won't break RSA by Anonymous Coward · · Score: 2, Informative

      Quantum computing is dependent on exactly one dubious assumption: That there is no [hard] limit to the complexity of a physical interaction.

      If we can have unlimited complexity, then we can have quantum circuits which are as good as [credibly] advertised; if we can not, then, at best, all we get out of it is a means to optimize a few computations.

    3. Re:Quantum computers won't break RSA by Anonymous Coward · · Score: 0

      I am still pretty convinced that the "quantum computer"-hype is based on fundamentally flawed assumptions, and that they won't break RSA (or other practical problems) of any reasonable size, that are not also easily solved with conventional computers.

      What fundamentally flawed assumptions?

    4. Re:Quantum computers won't break RSA by Anonymous Coward · · Score: 0

      They need 5 qubits to factor a low-end two-digit number. How many qubits do they need to factor a 2048-bit number? And how long do they think it will take to create such a computer? For years we've been hearing about quantum computers, but all of the existing examples we've seen have been capable of very trivial tasks. I'm still waiting to be impressed.

    5. Re:Quantum computers won't break RSA by gweihir · · Score: 1

      I agree. At this time, we cannot even know whether the physics itself holds up. Factoring 15 is something that can be done with a conventional analog computer, no actual quantum effects needed. So there are two hard road-blocks to this ever threatening RSA of real sizes: a) it may not actually be possible to use quantum effects for computations and what we currently observe may be something different and b) quantum computers may not scale to the required bit-sizes, ever. We see these hard scalability limits in every other technology, there is no reason to believe quantum computing will magically not be subject to them. And with the lack of progress in scalability in the last 20 years or so, It seems the limits may be very, very low, for example at 100 qbits.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    6. Re:Quantum computers won't break RSA by gweihir · · Score: 4, Interesting

      That is naive. You assume maintaining entanglement gets less than linearly more difficult and that noise is independent of the number of qbits. Both are not reasonable assumptions.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    7. Re:Quantum computers won't break RSA by Anonymous Coward · · Score: 0

      I am still pretty convinced that the "quantum computer"-hype is based on fundamentally flawed assumptions, and that they won't break RSA (or other practical problems) of any reasonable size, that are not also easily solved with conventional computers.

      I suspect that Quantum Computing is over hyped too, but admittedly haven't really studied it. Either way, encryption is not about perfect security. It is about making the effort required exceed the value of the information. RSA and such are good enough for mainstream work. Most attacks against encryption are indirect. Brute force attacks are not particularly effective these days, at least if the setup is decent. Sure, governments may need to actually go through a few more hoops, since the time required to protect their secrets is much longer. Of course, they could even simply pay someone to carry a key to a destination if they wanted to. No public key encryption is required for that.

    8. Re:Quantum computers won't break RSA by JoeMerchant · · Score: 1

      Also, this only breaks RSA style encryption. Good old fashioned shared key systems are immune to this, and many modern systems only use RSA-type encryption for the initial sharing of a secret key to both parties.

    9. Re:Quantum computers won't break RSA by Anonymous Coward · · Score: 0

      But. But... Kurzweil!

    10. Re:Quantum computers won't break RSA by cold+fjord · · Score: 0

      You seem to have skipped over the error correction part.

      --
      much of left-wing thought is a kind of playing with fire by people who don't even know that fire is hot - George Orwell
    11. Re:Quantum computers won't break RSA by KGIII · · Score: 1

      I have done quite a bit of reading. I wouldn't say that it's over-hyped so much as it's poorly understood. It's a bit like science and science journalism, at least as near as I can tell.

      --
      "So long and thanks for all the fish."
    12. Re:Quantum computers won't break RSA by RatherBeAnonymous · · Score: 1

      As with most things, the devil is in the details. With a TLS/SSL connection handshake, if you can break the RSA key exchange portion you can recover the symmetric encryption key that is used for the remainder of the connection. A man-in-the-middle attacker can easily record all packets in a connection without alerting either party. If they later break the RSA encryption, they can easily and efficiently decode the rest of the data stream.

      Enter the DH (Diffie-Hellman) and ECDH (Elliptical Curve DH) key exchange protocols. Replacing the RSA key exchange, they offer "forward secrecy" that should prevent an attacker from recovering the symmetric key because they don't send the symmetric key across the wire. There are a couple of caveats. Firstly, Microsoft's DH implementation is weak a generally considered insecure. Secondly, the NSA was heavily involved in ECDH development and many believe there are back doors in the protocol. Even

    13. Re:Quantum computers won't break RSA by GLMDesigns · · Score: 1

      Kurzweil is and others of the ilk (I'm one of them) is trying to get people to realize that exponential growth is non-intuitive. If growth continues at the much the present pace then in 15-20 years computers will be 1000 times as powerful as they are today. What can be done with that which is close to unimaginable today.

      Think of computers and the internet 20 years ago: Pentium 133s and 28.8 modems. In 2000 T1 connections (1.54 MB) cost $1000.00/mth and who knows how much to install. Now I got a better computer in my pocket, plus a camera, plus a calculator plus a movie camera and other things.

      We don't need quantum computing to get near the Kurzweilian future. (I'm not talking about true AI here - just the realization that exponential growth is taking place.

      --
      If you're scared of your govt then you need to further restrict its powers
      Vote 3rd Party in 2016 and beyond
    14. Re:Quantum computers won't break RSA by silentcoder · · Score: 2

      It took centuries for computing devices to go from the Abacus to the Hollerith tabulator. Along the way they gradually but steadily progressed. Mechanical computation devices got more and more advanced (read a bit of the history of mechanical computers -there were some very fascinating and surprisingly powerful ones over the centuries) - and when we reached their limits they were gradually replaced by electrical devices which were in turn slowly replaced by electronic devices (a line you can draw roughly at the point where mechanical relays were replaced by solid-state vaccuum tubes).

      But the semi-conductor revolution was waiting. It took a while to get off the ground - nearly two decades from when we built the first modern computers (in the seperates data from code sense) before transistors even appeared and another decade for them to become the standard tech. Even as they did work on semiconductors were continuing and ICs were well on their way but still a long way off.

      The same pattern happened in storage - as mechanical/magnetic storage got refined and improved over time - and we are currently in the midst of the transition to solid state storage.

      And right back some 2000 or more years ago there was somebody like you who said: "Fingers are still the best computing devices we have - they've been promising us that this 'abacus' thing will revolutionize computing in the near future but they still can't get the beads to reliably stay on the right side of the wire" and there's been people like you saying it about every revolution as it unfolded ever since.
      Computational technology has, in fact, been a running thread right through human history - and as it improved, society did as well, the better it got- the better we could organize ourselves (what is organisation after all, but the ability to process numbers - the faster and more reliably you can do that, the better things work).

      Right now our best bet, by far, for the next generation of computing is quantum. Positronic computing was mentioned by Asimov and Star Trek alike but considering a positron is the anti-particle of an electron it would offer exactly zero advantages over electrons while offering a huge containment issue (and in theory - a positronic computer would have to be built entirely out of anti-matter or the positrons would anihilate the circuitry), that one is really pure science fiction - because even though it's entirely theoretically possible it has no practical value. Biological computers are possible, but that adds a whole host of practical difficulties - a living computer is subject to diseases, it needs food and oxygen and water... it has all the difficulties, in fact, of a pet - and when you factor those in there is no real reason to believe it would be good at what computers are good at, it's more likely to be good at the things we are already good at ourselves. Nah, biological computer research is incredibly valuable - not for what it can teach us about computers but for what it can teach us about ourselves. What else is there ? Photonic computers - taking the fibre-obtics right into the CPU ? Theorectically it's possible but it has a whole host of it's own difficulties and electrons can already reach light-speed under some conditions so solving them will only offer marginal rewards - it may never be cost-effective for what it offers.

      Of all the research going on - this is the only one that promises the potential of another revolution similar to the switch from vaccuum tubes to transistors. And like all the previous ones, it will be the governments and large corporations who will be early adopters - and the military perhaps first of all. You probably won't see a home quantum computer for decades, but then it took decades from ENIAC to the ALTAIR. That doesn't make ENIAC the worthless symbol of some pipe dream.

      --
      Unicode killed the ASCII-art *
    15. Re:Quantum computers won't break RSA by Anonymous Coward · · Score: 0

      It's 2016. Where is my flying car and my weekly ticket to Europa or Mars?

    16. Re:Quantum computers won't break RSA by Anonymous Coward · · Score: 0

      Kurzweil is an idiot and the Singularity is a futurists wet-dream.

      How so? They take Moore's Law and extrapolate into the infinite future. Except that Moore's Law isn't a law of physics, it's an observance of a technical trend. Not to mention that Moore's Law, after much premature speculation about this, is now clearly in trouble and not scaling effectively anymore.

      Ultimately Kurzweil is predicting the future and all such efforts, while not useless, are highly error prone. I predict Kurzweil is wrong on the timeline, the specifics of the Singularity, and the attractiveness of that capability to humanity even if we were to achieve such possibilities.

    17. Re:Quantum computers won't break RSA by delt0r · · Score: 1

      No he hasn't. If the error rate is a *constant* then error correction can work, with a *lot* more qbits i mite add. That is if the total "error" is simply proportional to the number of qbits. However that is *not* how the physics works, in fact there is quite a lot of evidence that the error rate goes up faster than proportional to the number of qbits, so if i add a qbit i need to add 2 more error correcting qbits which requires 4 more error correcting qbits..... This makes a quantum computer over a particular size/number of operations impossible in this universe. I know quite a few people working on this problem that believe this is the case, there is some upper limit below 1000qbits. There are of course others who don't think this is the case. But right now there is no proof either way.

      --
      If information wants to be free, why does my internet connection cost so much?
    18. Re:Quantum computers won't break RSA by delt0r · · Score: 1

      Well i think over hyped and misunderstood are the problem. Just look at mainstream articles on quantum teleportation...

      --
      If information wants to be free, why does my internet connection cost so much?
    19. Re:Quantum computers won't break RSA by Anonymous Coward · · Score: 0


      I'm prepared to bet the safety of my encrypted data on that

      Are you willing to put your money where your mouth is?

      Here's a simple challenge. Buy $1000 worth of bitcoin and put it in an offline, cold storage wallet. Take a copy of the wallet, and encrypt it using PGP with a 1024 bit RSA key. Publish the public key and the encrypted wallet on the internet for anyone to crack. Wait 40 years.

    20. Re:Quantum computers won't break RSA by gweihir · · Score: 1

      Actually, exponential growth for computer speeds has stopped a while ago and was never as good as advertised before. The thing is that actual experts understand that many important problems cannot be parallelized and hence single-thread performance is what determines speed. That has mostly stalled in the last 10 years or so.

      Kurzweil is an incompetent moron with a grand vision he sells well. Kind of a bit like Trump, although I do not think Trump is stupid enough to believe the things he says. With Kurzweil I am not so sure.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    21. Re:Quantum computers won't break RSA by gweihir · · Score: 1

      Exactly, thank you. Error correction is not magic. Error correction is what keeps QC research going (very, very slowly) at this time, because without it there would be absolutely no point.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    22. Re:Quantum computers won't break RSA by GLMDesigns · · Score: 1

      Exponential growth has stopped? Perhaps, if you're talking about Moore's law. CPU speed hasn't increased much for about 10 yrs. But there are multi-core processors now. Take a look at the list of the fastest computers. (see below) What would you call a chart plotting it's performance? I see something approximating exponential growth. (7 doubles in 10 years)

      The key concept to grasp is not the Kurzweilian AI and human/robot mind melds. The key concept is that exponential growth is a hard thing to grasp. Our mental models are linear .

      2015 - FASTEST (RMAX) 33,862.70

      2005 - FASTEST 280.6

      http://www.top500.org/lists/

      --
      If you're scared of your govt then you need to further restrict its powers
      Vote 3rd Party in 2016 and beyond
    23. Re:Quantum computers won't break RSA by david_thornley · · Score: 1

      Gluing a large number of processors together is an excellent thing for many problems, but not all. Moreover, we're getting reasonably close to fundamental limits. Silicon traces have to be a certain number of atoms wide, and communications are limited by lightspeed, since no signal can go farther than 30cm in a nanosecond. There's still advances we can make, and we can come up with more ingenious techniques for getting more out of what we can do, but performance improvements are going to slow down fairly soon.

      One reason exponential growth is a hard thing to grasp is that it's a hard thing to maintain. Normally, it will hit a limit of some sort fairly fast. Richardson's analysis of arms races suggested that an arms race that goes exponential will probably break out of exponential growth with a war. Exponential population growth will soon run into resource limits. We don't have a good grasp on exponential growth because periods of such growth are short and periods of some sort of limitation are much longer. We've had a surprisingly long run in semiconductor exponential growth, but it isn't going to last for all that much longer.

      If the power of the world's fastest computers has multiplied by over 100 in ten years says little about where it will be in ten or twenty years.

      --
      "When you have eliminated the unacceptable, whatever is left, however improbable, must be the truthiness" - Holmes
    24. Re:Quantum computers won't break RSA by GLMDesigns · · Score: 1

      I don't know how much longer it's going to last (exponential growth) but if it lasts for another 30 years at this pace then computers will be 1,000,000 times more powerful than they are now - with incredible ramifications for every field. Again, I'm not claiming true AI here but ... something. And it's something I can't imagine - cellular repair; gene therapy; VR learning tools, a dystopian all-powerful, nanny-state brooking no dissention; the end of scarcity; ... I don't know.

      But I credit Kurzweil for bringing up the topic and evangelizing. There may be a lot of hyperbole there but I guess I have more tolerance for it than you. I don't see it simply as self-aggrandizing bullsh!t. I see it as bringing the potential into view. The same as Gibson's Neuromancer: I don't see that dystopian future as particularly relevant but it was an interesting read.

      --
      If you're scared of your govt then you need to further restrict its powers
      Vote 3rd Party in 2016 and beyond
    25. Re:Quantum computers won't break RSA by david_thornley · · Score: 1

      It isn't clear to me that we can make computers a million times more powerful than what we've got. There's obviously room for advancement still, but I'd be mildly surprised if they got to a thousand times as powerful as what we have now, except for specialized applications. (My current home computers are, very roughly, a million times as powerful as my original personal computer, a TRS-80, which I got roughly forty years ago.)

      Moreover, this doesn't translate into a great improvement in some problems with exponential complexity, like all sorts of combinatorics. If the complexity is O(2^N), a computer a million times as powerful means we can solve a problem 20 bigger than we used to be able to.

      Kurzweil's Singularity is well worth thinking about, but I'm not certain we're going to get anything that dramatic. There are some things that are pretty certain to happen, such as tailored foodstuffs, so that we'll no longer be dependent on Nature to provide even the basis of nutrition and taste and texture.

      --
      "When you have eliminated the unacceptable, whatever is left, however improbable, must be the truthiness" - Holmes
    26. Re:Quantum computers won't break RSA by Anonymous Coward · · Score: 0

      I agree, and in fact my assessment is even darker. It's the emperor's new algorithm. I have a Ph.D. in physics, and years of study of physics history and basic theory as an amateur practitioner. I can only say that the descriptions I read of Shor's algorithm and its implementation don't square with my own understanding.

      I'll mention that I read Feynman's essay some years ago, and this is not the same thing he was talking about!

  9. And when will we see this? by Anonymous Coward · · Score: 0

    and when will we see this be put to use in reality? 10 or 20 years? or never?

    1. Re:And when will we see this? by gweihir · · Score: 1

      From the lack of scaling in the last 20 years or so of quantum computing research, I would put 50 years for low RSA bit-counts (e.g. 768 bits, requiring > 1000 qbits if you take error correction into account) as lower limit. It may also well be "never".

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  10. My Facebook selfies ... by Anonymous Coward · · Score: 0

    are luckily Zuckerberged to near infinity so the NSA won't be snooping on me

  11. Where TFA? by Anonymous Coward · · Score: 1

    The link points to a science article which is closed.

    Why are we advertizing an article that can't be read?

  12. For an actually good summary of this research by JoshuaZ · · Score: 4, Informative

    For an actual summary of this research see http://www.scottaaronson.com/blog/?p=2673 by Scott Aaronson who is a quantum computing expert. The key thing here is that they factored 15 with high probability without having to sort of cheat by making a circuit that was more likely to work if one suspected that 15 had factorization resembling 3*5. As usual, this is getting completely overblown by the popular press. It is an important step towards actually making quantum computers that can factor big numbers, but it is nowhere near anything that would make RSA or other factoring based crypto obsolete.

  13. Found the problem by Anonymous Coward · · Score: 0

    "...publicly store your secrets..."

  14. how many did the gov order? by Anonymous Coward · · Score: 0

    So the NSA, the CIA, the FBI and probably a few others placed orders for 10 MIT quantum computers each? when it comes to the government and "security, think of the children!" money is no object.

  15. Improvement to Shor's algorithm, no new technology by Anonymous Coward · · Score: 5, Informative

    If you actually read the scientific article (which is available as a preprint unter [1]), what the authors discuss is how to significantly improve Shor's algorithm, the quantum algorithm for factorizing prime numbers. They show that the number of qubits needed to perform Shor's algorithm is actually quite a bit lower than what previous versions of the algorithm required - and they claim that their version is much more scalable than previously known versions.

    They demonstrate their algorithm by factorizing the number 15 using trapped ions. That elementary qubit operations can be performed with trapped ions has already been demonstrated [2], that part is nothing new. Factoring the number 15 with Shor's algorithm is has also been done before. But since their algorithm doesn't need nearly as many qubits as the previous formulation of Shor's algorithm, specifically they only need to have a single ancillary qubit in addition to the qubits required to represent the number to be factorized (in contrast to 3n ancillary qubits), and given the fact that the quantum Fourier transform operation that was previously required to be performed on the ancillary qubits is difficult to pull of in practice while keeping quantum coherence, they argue that their algorithm will be much easier to implement in real quantum systems.

    So their research is actually a big step forward when it comes to a potential actual practical realization of Shor's algorithm, and what they did is still very impressive (even the experimental part of their work), but their work doesn't address the problem of actually scaling up the number of qubits: 5 bits have been done before, and while their work means that less qubits are needed, it's not like even a (512+1+error correction) qubit computer with quantum coherences is around the corner (note that to break 512 bit RSA you don't need a quantum computer). Furthermore, there's a huge debate in the community as to what the best design for a scalable qubit architecture is: the authors of this paper seem to follow the school that wants to use ion traps, but there are also other approaches to implementing qubits: superconducting qubits (in various variants), spin qubits (including nuclear spins), semiconducting qubits, adiabatic quantum computation, and a couple more. A lot of people in the community are working on all of these different approaches, and it is not clear to me which of these will be the most effective way to implement a quantum computer in the end. And scaling this up beyond 100 qubits with full quantum coherence and quantum control of qubit operations (from all reports e.g. the D-Wave machine "only" does quantum annealing with ~500 qubits, and doesn't implement a universal quantum computer) is something that's still quite a bit away. How long? I don't think anybody can really predict. Could be 5 years, could be 10, could be 50.

    To reiterate: the paper is a breakthrough, because (if we leave out error correction for the moment, which increases the number of qubits required) to factor a 1024 bit RSA key, one would previously have needed 1024 + 3 * 1024 qubits and a very difficult to pull off quantum operation (quantum Fourier transform) on 3 * 1024 qubits simultaneously. This paper reduces that to 1024 + 1 qubits, where the KQFT operation only has to be applied to the 1 additional qubit. We still don't know how to actually manufacture a quantum computer that maintains coherence well enough with that many qubits, so there's no need to start panicking when it comes to this, but these kind of improvements do show that research towards asymmetric cryptography that is safe against quantum computing is required - and that we should really start implementing these kinds of algorithms NOW, so that when somebody actually has breakthrough in this regard, we have the technology in place to switch at that point. A good starting point for people that are interested is the pqcrypto.org site [3] and the excellent talk by Dan Bernstein and Tanja Lange at 32c3. [4]

    [1] http://arxiv.org/abs/1507.08852
    [2] https://en.wikipedia.org/wiki/Trapped_ion_quantum_computer
    [3] http://pqcrypto.org/
    [4] https://www.youtube.com/watch?v=6XeBvdm8vao

  16. scalability by e**(i+pi)-1 · · Score: 4, Insightful

    The key will be scalability. Its an interesting experiment as it taps into the fundamentals of computing. It could however well be that the effort of keeping things disentangled grows exponentially (something which Shor's algorithm does not address). Like in dynamical systems theory, where computing the 10th iterate of f(x)=4x(1-x) with some initial condition like x=0.4 is no problem. It gives 0.297... already for a a hundred iterations the result become ambiguous and the answer becomes hardware and software dependent. No error correction can bypass these fundamental sensitive dependence of initial condition difficulty. So, it could well be that it is possible to factor a 10^10 digit number nicely but that things become more and more difficult larger numbers like integers with 100reds of digits and that RSA will remain save from quantum computer attacks. But who knows? The nice thing is that if it will be faster, one will be able to demonstrate it by factoring otherwise not yet factored numbers.

    1. Re:scalability by gweihir · · Score: 4, Informative

      That key has eluded researchers for a few decades now. It looks very much like there is an upper limit on the number of qbits that can be entangled in practice if computations are to be performed and as if that upper limit is somewhere around 100. With that, not even very old and outdated RSA-768 is threatened.

      That is why these stories are so utterly demented. They are akin to claiming the invention of the logic gate will make 2048-bit computers possible that run at 1000GHz. As we now see in practice, 64 bit at 5GHz is pretty much the viable limit for low-cost and it does not go much further with extreme hardware. In reality, things do not scale after a certain limit and for quantum computing, that limit will be very low.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    2. Re:scalability by Anonymous Coward · · Score: 0

      Huh? Your first sentence was okay. I was dubious about your mention of "the fundamentals of computing" as a quantum computer and a Turing machine are different. By your third sentence you were losing me. Quantum computing requires qubits to be entangled with each other. No one cares if they're entangled with anything else, in so far, as this doesn't "disentangle" the qubits themselves. Normally people talk about coherence. Dynamical systems theory? Oh, you mean Chaos theory. Not all dynamical systems are chaotic. I can compute f(x) = x(-1) for whatever iteration you like with no loss of accuracy.

    3. Re:scalability by Anonymous Coward · · Score: 0

      They are akin to claiming the invention of the logic gate will make 2048-bit computers possible that run at 1000GHz.

      Even in the 80s, no one dreamed of doing 1THz clock cycles. We did dream of light-based computing, which didn't come through, but even at the beginning we knew the physical reasons why 1THz switching was unreasonable. Now if you had said 10 or even 100GHz, okay, some more expensive materials would have made that possible, but you didn't, so I'm not responding to that.

      As we now see in practice, 64 bit at 5GHz is pretty much the viable limit for low-cost and it does not go much further with extreme hardware.

      64 bit is because it is a power of 2, and because 32 bit was too small for double-precision or memory addressing. There is very little call for quad-precision, and 128 bit for memory addressing will be a while. 128 bit stuff for SIMD instructions, okay, but your 64 bit at 5 GHz limit is no limit.

  17. But what if we add more lasers? by SciCom+Luke · · Score: 4, Funny
  18. Quantum Computer and Chinese by Anonymous Coward · · Score: 1

    Issac Chuang is a Chinese

    Having a Chinese in a leading role developing cutting edge quantum computer only means China will be one of the first nation to deploy quantum computers

    1. Re:Quantum Computer and Chinese by Anonymous Coward · · Score: 1

      Issac Chuang is a Chinese

      Having a Chinese in a leading role developing cutting edge quantum computer only means China will be one of the first nation to deploy quantum computers

      That's odd. I'm pretty sure he is an American.

    2. Re:Quantum Computer and Chinese by Anonymous Coward · · Score: 0
    3. Re:Quantum Computer and Chinese by Anonymous Coward · · Score: 0

      (and Africans are never Africans, they are all American Europeans, or will be after some cannibal meal or other)

    4. Re: Quantum Computer and Chinese by Anonymous Coward · · Score: 0

      Troll alert

  19. Re:Quantum computers were "5 years away"... in 197 by Hylandr · · Score: 0

    Quantum is the new Alchemy

    http://www.crystalinks.com/alc...

    --
    ~ People that think they are better than anyone else for any reason are the cause of all the strife in the world.
  20. Re:Blm by Anonymous Coward · · Score: 0

    Time to sweep away all the monsters and demons!

  21. That is such utter and complete nonsense by gweihir · · Score: 4, Insightful

    First, most encryption is not even really affected. For block-ciphers a working and large enough QC halves the key-length. AES-256 would still be perfectly secure and AES-128 would still be hard (but maybe possible) to break. And second, factoring RSA-2048 (which is regarded as too short today) would need around 2200 qbits to factor with this "breakthrough". They are at 5 qbits now. Where where they 10 years ago? Oh, right, at the same low number. If progress is made at this rate, they will be able to break RAS-2048 in x years, where x goes towards infinity, i.e. _never_.

    This is about as valid as claiming the invention of paper threatens RSA, after all you can do attacks far faster with paper than with stone tablets.

    Can we please stop the moronic and false "success" stories about quantum computing?

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    1. Re:That is such utter and complete nonsense by Anonymous Coward · · Score: 0

      First, most encryption is not even really affected. For block-ciphers a working and large enough QC halves the key-length. AES-256 would still be perfectly secure and AES-128 would still be hard (but maybe possible) to break. And second, factoring RSA-2048 (which is regarded as too short today) would need around 2200 qbits to factor with this "breakthrough". They are at 5 qbits now. Where where they 10 years ago? Oh, right, at the same low number. If progress is made at this rate, they will be able to break RAS-2048 in x years, where x goes towards infinity, i.e. _never_.

      This is about as valid as claiming the invention of paper threatens RSA, after all you can do attacks far faster with paper than with stone tablets.

      Can we please stop the moronic and false "success" stories about quantum computing?

      How do you know that someone isn't going to have a "eureka" moment and figure out how to form (real or virtual) coherence with unlimited qubits? How many breakthroughs have occurred after many years of people attempting to do something with no success and then someone else coming along and saying "hang on, what happens if I do this?"
      Your attitude towards this reminds me of a short story that I read many many years ago about how humans discovered a sentient species living on Venus and we ended up at war with them. The issue was that the Venusians couldn't come out of their high pressure environment and humans couldn't go into the the Venusian high pressure environment. The main plot of the book revolves around the military attempting to develop a force field but failing to keep it up for more then a few milliseconds so they decide to broker a truce with the Venusians as neither side can do much warring on the other's home turf. The story ends with the military/political guys leaving and, shortly after, the scientists having a eureka moment by realising that they do not need to have the force field run for longer but instead they can turn it on and off again as fast as they can to provide a viable force field (the story used a fluorescent light as their analogy).

      TL;DR; Just because you cannot see any way for the scientists to accomplish coherence of enough qubits to perform decryption based on their track record, it doesn't mean that they never will. All it takes is one little breakthrough...

  22. Re:Improvement to Shor's algorithm, no new technol by gweihir · · Score: 2

    And scaling this up beyond 100 qubits with full quantum coherence and quantum control of qubit operations (from all reports e.g. the D-Wave machine "only" does quantum annealing with ~500 qubits, and doesn't implement a universal quantum computer) is something that's still quite a bit away. How long? I don't think anybody can really predict. Could be 5 years, could be 10, could be 50.

    Could also very well be "never". Just look at the lengths CPU manufacturers have to go to get to 5GHz. A bit more is likely feasible, but, say, 100GHz is likely completely infeasible unless a mythical new technology presents itself. It has not, despite now 50 years of intense research, so what we currently have in CPUs may very well be close to the end of the line in this universe. It is quite likely that quantum computing (if it even works at all, factoring 15 could well be some other effect), runs into pretty hard scalability limits at 100 qbits or so and will never be a threat even to yesterday's RSA key lengths.

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  23. Re:Improvement to Shor's algorithm, no new technol by Anonymous Coward · · Score: 0

    Could also very well be "never". Just look at the lengths CPU manufacturers have to go to get to 5GHz.

    This isn't an accurate statement at all. multi-core architectures have made pushing the ghz barrier uneconomical and for the most part pointless, much higher rates aren't just possible they have been achieved many times and current theoretical limits are due to the materials used which a lot of research is going into alternate materials, I would say we will see clock rates many times higher in coming years when we transition to other materials. They have had CPU's in labs that went up to and beyond 8Ghz a decade ago even on current transistor tech, but they simply aren't worth the effort to refine at this point as there is a much higher and faster return on multi core at lower speeds.

  24. Re: Quantum computers were "5 years away"... in 19 by Anonymous Coward · · Score: 0

    Yes but when they do actually get here today's strongest encryption will be a complete joke. As I said before in 100 years a 5 yr old with their equivalent of a cell phone will be able to decrypt anything encrypted today. The absolute weakest computer in 100 years will make today's biggest super computer look like the original printing press. Yet so many people can't seem to fathom just what changes will happen in the next century. Technology is moving faster and faster and we've more advances in tech and medical knowledge in the last 100 years than all of human history. The next 100 years will even more. The human race is at the very beginning of huge exponential growth of knowledge yet so many people can't seem to grasp that.

  25. Re:Improvement to Shor's algorithm, no new technol by Anonymous Coward · · Score: 0

    100 GHz is feasible, it's not done because it's easier to have the same clock for the entire chip. But it's possible to have small areas running at 100 GHz and to use asynchronous communication between different areas.

  26. Fund research via Bitcoin by skaag · · Score: 2

    With such monstrous computing power, they could mine bitcoins and fund their R&D entirely through Bitcoin mining.

    --

    All those moments will be lost in time, like tears in rain... time... to... die...

  27. whipslash, can you fix that abusive modding? by Anonymous Coward · · Score: 0

    whipslash, we have another case of abusive modding. The parent comment is extremely relevant, and should not be -1. Can you please fix it? Whoever downmodded that comment, which is perhaps one of the most insightful here, should never be allowed to moderate again. Causing good comments here to be hidden due to bad moderating is inexcusable, and whoever committed this abuse should be punished severely. They have brought direct harm to Slashdot.

    1. Re: whipslash, can you fix that abusive modding? by Anonymous Coward · · Score: 0

      Off with the pinky!

    2. Re:whipslash, can you fix that abusive modding? by RuffMasterD · · Score: 4, Insightful

      Shit happens when you post AC. If you won't own your comment and risk your reputation on it, then don't complain when it gets modded -1.

      --
      Human Rights, Article 12: Freedom from Interference with Privacy, Family, Home and Correspondence
    3. Re:whipslash, can you fix that abusive modding? by Anonymous Coward · · Score: 0, Redundant

      Still, doesn't change the fact that an otherwise 'insightfull' comment has been withdrawn from the eyes of the mayority of slashdot-readers.

      If simply posting as an anonymous coward means your posts will be modded down regardless of their content, then there is obviously a very serious problem with the moderation system.

    4. Re:whipslash, can you fix that abusive modding? by Anonymous Coward · · Score: 0

      It's an AC post, what did you expect? That people will waste their valuable mod points promoting that trash? The most an AC should expect is a +1. Very rarely does an AC deserve a +5. The whole thing can be summarized with "Every five years they say quantum computers are five years away". But instead of using only 63 character, that post uses nearly 1,000 characters.

      Maybe you should try stating your point more concisely rather than rambling like an idiot. Whether you want to believe it or not, your above post is shit (I'm assuming you're the same AC, since you're defending it so vehemently). It's certainly not insightful - we're all aware of 'marketing speech' where '5 years away' means 'we're fishing for investors'.

    5. Re:whipslash, can you fix that abusive modding? by Anonymous Coward · · Score: 0

      Frankly, it does little good to waste a mod point to get an AC down to -1, unless the post is offtopic drivel. Leave the AC at 0 if it's anywhere near on topic, please. It's hard enough to get visibility as an AC even without such silly downmods.

  28. Hmmmmmm by JustAnotherOldGuy · · Score: 1

    Okay, this may be a foolish question, but if you encrypted something and then encrypted it again (with a different key) how would you know when you had gotten through the first layer of encryption? How would you know that you'd successfully decrypted the first layer?

    The first set of decrypted info would still presumably look like encrypted data (or random shit), so how would you know that it had actually been decrypted?

    --
    Just cruising through this digital world at 33 1/3 rpm...
    1. Re:Hmmmmmm by Anonymous Coward · · Score: 0

      Assuming symmetric authenticated encryption (i.e. AES-GCM), each layer will have a MAC along with the ciphertext. To break the encryption you'd have to guess the encryption key. When you get it right, the MAC will verify so that's how you know.

      This is the same mechanism that lets you know that a ciphertext hasn't been modified by an attacker when you decrypt data that you know the key for.

    2. Re: Hmmmmmm by Anonymous Coward · · Score: 0

      it usually "works" by finding mathematic weaknesses in the cipher, which reduces workload from 128 to 20 bits.

      then your scenario is a 40 bit problem. still a workload that can be solved.

      or they get your key material hook and crook, which is how they most likely do it today. one kernel exploit is usually sufficient.

  29. This new computer sponsored by... by l0n3s0m3phr34k · · Score: 1

    Setec Astronomy

    1. Re:This new computer sponsored by... by Zeroko · · Score: 1

      It was a Necessary Motto, of course.

  30. Re: Quantum computers were "5 years away"... in 1 by Anonymous Coward · · Score: 0

    Long-term change is often greatly overrestimated and short-term is underestimated.

  31. Topplin' da Dominoes! by Dutchmaan · · Score: 2

    I used my quantum computer to solve the problem of cold fusion, which allowed me to finish my flying car design!..

    1. Re:Topplin' da Dominoes! by Anonymous Coward · · Score: 1

      cold fusion is already solved, both palladium base and nickel based (more energy) look it up on e-catworld.com

    2. Re:Topplin' da Dominoes! by RespekMyAthorati · · Score: 1

      Congratulations on your flying carpet!

  32. Once the quantum world is able to factor 15 by tgibson · · Score: 1

    the encryption world will just start using 16.

  33. News Flash! by eepok · · Score: 4, Insightful

    Things that don't yet exist may make things that currently exist obsolete.

  34. Re:Improvement to Shor's algorithm, no new technol by colinrichardday · · Score: 1

    the quantum algorithm for factorizing prime numbers.

    That problem may be simpler than you think.

  35. Re: Quantum computers were "5 years away"... in 1 by Anonymous Coward · · Score: 1

    In 100 years we won't have the energy to tun this techno-based world anymore so we'll have reverted back to agriculture. No computers. No technology. No science, except for basic biology and simple weather forecasts.

  36. Re:Quantum computers were "5 years away"... in 197 by Aighearach · · Score: 2

    Meanwhile, in my Universe they've existed since the 90s and now even my local University has a few qubits. When I was a kid, all we had was a few q*berts.

  37. Re:Quantum computers were "5 years away"... in 197 by Aighearach · · Score: 1

    Alchemy is the new alchemy, too.

    http://www.scientificamerican....

  38. Re:Improvement to Shor's algorithm, no new technol by Anonymous Coward · · Score: 0

    Oh, boy.

    In another reply from you in a different sub-thread of this post, you accuse your parent poster of making two assumptions.

    Here, in your own post, you make far more assumptions of your own.

    You are a hypocrite, gweihir.

  39. Re: Quantum computers were "5 years away"... in 19 by Anonymous Coward · · Score: 1

    100 years from now people will be growing crops with Brawndo - The Thirst Mutilator

  40. Re:Quantum computers were "5 years away"... in 197 by Anonymous Coward · · Score: 0

    Your post conveniently ignores the fact that quantum computers actually are a thing, and have been for a while.

  41. Wtf is a quibit by Anonymous Coward · · Score: 0

    Wtf is a quibit?

  42. Noah's Salvation Agency by Anonymous Coward · · Score: 0

    The NSA has a 300 qubits by 50 qubits by 30 qubits sized quantum-cluster computer, aptly codenamed The Ark.

    1. Re: Noah's Salvation Agency by Anonymous Coward · · Score: 0

      they can go pound sand because i do not use the ciphers and approaches their stooges want to make me use.

  43. Re:Quantum computers were "5 years away"... in 197 by KGIII · · Score: 1

    I was alive in 1972, albeit just 15. I attended a fairly well-to-do preparatory school. At that school we actually had a connection with a distant university, a forerunner of the Internet. I was not nearly as interested in computers then as I am today, but that's okay because I'm not professing to be an expert on the subject.

    What I am saying is that if there were any serious talk about quantum computers in 1972 then there's a good chance I'd have heard about it. I was (and still am) an avid fan of science fiction and I don't even recall reading about any quantum computing in science fiction, at that time. Granted, there are still vast numbers of bodies of work that I've not read. Again, I don't claim to be an expert on the subject.

    So, if you don't mind... Who was telling you, in 1972, that quantum computers were five years away? I recall Feynman talking about it in the early 80s and I want to say that he wasn't quite the first but one of the first to theorize about them. There was some ado about them in a very specific task, as I recall, a few years prior to 1972 but that was not something that anyone was proposing would be in just five years.

    As near as I remember, even Feynman was cautious about such - including his concepts of nano-technology and, in the early/mid-1980s was postulating that such were, "50 years out, at least." One of his lectures, a neat one by the way, had horribly drawn machines comprised of just a few atoms and the machines were doing replication and building smaller machines out of atoms. I'm just a layperson, or so I claim and believe, but I'm going to add that his time-frame estimates might not be all that far off.

    Anyhow, if anyone was saying that they were five years away, in 1972, you were either listening to crazy people or are taking things woefully out of context. The device proposed (maybe even built) in the late 1960s was so different from this as to be an entirely different concept. I do not recall any serious speculations about a time-frame until the mid/late-2000s but, again, I am not an expert on the subject.

    --
    "So long and thanks for all the fish."
  44. Re: Improvement to Shor's algorithm, no new techno by Anonymous Coward · · Score: 0

    i am always hearing it is about power consumption, not clocking....

  45. Re: Quantum computers were "5 years away"... in 1 by Anonymous Coward · · Score: 0

    It got elektrolights!

  46. Re:Improvement to Shor's algorithm, no new technol by mrthoughtful · · Score: 1

    Probably one of the best comments I have ever read on /.

    --
    This comment was written with the intention to opt out of advertising.
  47. Re:Quantum computers were "5 years away"... in 197 by michelcolman · · Score: 1

    OK, maybe 6, tops.

  48. Martin Gardner's Finest Puzzle Offering by TheRealHocusLocus · · Score: 1

    Well done abstract.

    Large number factorization is one of integral-nature's greatest frontiers. I find it amazing that within my lifetime a curiosity of mathematics of interest to theorists and puzzle-makers has become the keystone of privacy in the world. For me there was a single 'Eureka' moment. Along with many others I caught a glimpse of today's world back in August 1977 thanks to a column by Martin Gardener in Scientific American: "A new kind of cipher that would take millions of years to break" Read it! . You can sense the author's excitement. I remember carrying this issue around with me for days, trying to wrap my head around the concept... to me these few pages are among the greatest that ever appeared in a magazine. I'd just devoured David Khan's The Codebreakers which describes centuries of cat-n-mouse games with substitution, transposition and polymorphic ciphers augmented in the end by devilishly simple mechanical apparatus that became devilishly complicated as it scaled... and on the other end the mathematical attacks of cryptanalysis (greetz to Friedman and Sinkov) that can de-construct these, often unseen. It was a brilliant game and had seemed to reach its end. RSA was like a bolt of lightning from clear sky. We knew then that factoring was hard. This had to be the way out.

    Back then sieving seemed the only practical attack, and anyone could see how progress in sieving degrades so quickly as to represent a (practically) solid barrier. Then a number of novel ideas for parallelizing the attack were proposed, even such flights of fancy as a 'pond' of biological computers, like bacteria, working on a single problem. But even such approaches run into bottlenecks, as the amount of inter-thread communication necessary to manage the attack turns a time problem into an inter-node bandwidth problem.

    Then another bolt of lightning! Shor's algorithm turns a classic dilemma into yet another (quantum) engineering challenge in much the same way that Turing realized enigma would fall in reasonable time, if he could only get the necessary part together and make them work. Since we're down to atoms this may even be the last frontier. Here's hoping that some where along the way to solving the problem, that day when the fence of RSA falls, we will have evolved into a more considerate species.

    Because, as you all know deep down, it is impolite to read others' mail.
    Imagine a world in which we could tear open any digital envelope, yet fail to do so from simple human restraint.
    What a world that could be.

    --
    <blink>down the rabbit hole</blink>
  49. Re:Quantum computers were "5 years away"... in 197 by Anonymous Coward · · Score: 0

    Quantum is the new Alchemy

    http://www.crystalinks.com/alc...

    Except that quantum things are real, alchemy is imaginary.

  50. Re: Quantum computers were "5 years away"... in 19 by Anonymous Coward · · Score: 2, Insightful

    Two things. First, exponential growth can't continue indefinitely. Second, once all the easy problems are solved, the ones left will require 90% of the total time. We have the lessons of AI and fundamental physics, where all the "easy" problems were solved decades ago, both disciplines becoming pretty stagnant since. Ergo, for all we know, the world 100 years from now might not look all that different.

  51. Re:Improvement to Shor's algorithm, no new technol by Anonymous Coward · · Score: 0

    You're post comes across as something said by a teenager who barely understands what they're talking about. You know that? You're aware that there is every reason to push the ghz barrier, right? You see, the vast majority of real problems have an inherent limit of how parallel you can make them. Not only that, but the more parallel you make the problem, the less speed up you get. For example. Take a task that runs on a single core at X speed, running on two cores you might see 1.9X speed, and four cores you might only see 3X speed. And those sorts of scaling imply that it's very good at being paralleled. As apposed to if a piece of code runs at X speed on Y ghz, it will run at 2X speed at 2Y ghz.

    What you don't seem to understand is why they don't increase the clock speed. Remember, thermal dissipation increases at the square of the clock speed. Any increase in clock speed anymore must be accompanied by an improvement in the thermals. Yes, you can make an 8ghz chip today, as they did a decade ago, but like a decade ago, it needs to be cooled with liquid nitrogen in order to keep the internal resistances low enough that the chip will actually function (the faster you go, the lower the resistance needs to be so the gates can charge in time, but as things get warmer, resistance increases). This isn't exactly practical in any environment other than a lab. My 4GHz i7 produces a hell of a lot of heat. To take it to 8GHz would be 4 times as much heat, and at that point water cooling is no longer a fun PC mod, but minimum and potentially insufficient requirements. 16 ghz, and you're talking about something nearing the temperature of the surface of the sun if left uncooled, how the hell do you cool that?

  52. Re:Improvement to Shor's algorithm, no new technol by Anonymous Coward · · Score: 0

    For factoring prime numbers? I can do that in my head, instantly.

  53. quantum encrytion by Anonymous Coward · · Score: 0

    It is unhackable

    1. Re:quantum encrytion by delt0r · · Score: 1

      It is also horrendously cumbersome and impractical for many real world cases.

      --
      If information wants to be free, why does my internet connection cost so much?
  54. Re:Improvement to Shor's algorithm, no new technol by silentcoder · · Score: 1

    >something nearing the temperature of the surface of the sun if left uncooled, how the hell do you cool that?

    Hold it against Hillary's tit ?

    --
    Unicode killed the ASCII-art *
  55. I kud you not by epine · · Score: 1

    I think I need to hack the Drumphinator to also replace all instances of the word "could" in headline font with "kud", as in "I kud you not".

  56. Re:Improvement to Shor's algorithm, no new technol by Anonymous Coward · · Score: 0

    Best comment ever!!

  57. HEY WHIPLASH . . . by Anonymous Coward · · Score: 0

    I would like to suggest that the moderation process be revised, so that usernames are kept hidden until the moderator is finished. This should certainly help prevent the bias against ACs. The validity of a comment should have nothing to do with the poster's history.

    It should also prevent users from stealing mod points by plagiarizing a comment under the claim that they are "pulling it out of moderation hell". There is nothing I less respect for than a thief.

    1. Re:HEY WHIPLASH . . . by Culture20 · · Score: 1

      I would like to suggest that the moderation process be revised, so that usernames are kept hidden until the moderator is finished. This should certainly help prevent the bias against ACs. The validity of a comment should have nothing to do with the poster's history.

      Admirable, but a malicious moderator can just as easily log in anon with another browser to match up comments with users.

  58. Re:Quantum computers were "5 years away"... in 197 by Impy+the+Impiuos+Imp · · Score: 1

    Fusion has been 40 years away for longer than that.

    --
    (-1: Post disagrees with my already-settled worldview) is not a valid mod option.
  59. Re: Quantum computers were "5 years away"... in by Anonymous Coward · · Score: 0

    It's what plants crave.

  60. Re: Quantum computers were "5 years away"... in 1 by LinuxLuver · · Score: 1

    It will be proprietary and half a dozen well-placed accidents could wrote out that progress. Very few people today actually know how to do the most advanced things. Such thinly distributed knowledge could very easily be lost in a single accident.

    --
    Only boring people are ever bored.
  61. Re:Quantum computers were "5 years away"... in 197 by kwbauer · · Score: 1

    "Except that quantum things are real", but not until you open the box. Before that they are both real and not real.

  62. Re: Quantum computers were "5 years away"... in 19 by castionsosa · · Score: 2

    Not all encryption. -some- encryption, namely RSA and public key based algos that can be factored with Shor's algorithm. We will just wind up moving to UOV (Unbalanced Oil and Vinegar), lattice-based crypto, new ECC based encryption, or another method, and life will go on, just like it did when MD5 was weakened, and DES's short key space was found to be easily run through.

    Life will go on.

    As for symmetric encryption (AES, IDEA, BLOWFISH), quantum crypto won't do much for this, so there is no need to worry here.

  63. Re:Improvement to Shor's algorithm, no new technol by Anonymous Coward · · Score: 0

    Sigh, I just used my last mod point (in this thread, so anon so as to not undo them).

  64. Wake me up... by Anonymous Coward · · Score: 0

    when they get past 20 qubits. Until then, it is all media hype. Even then, if it takes 10 minutes to read the result, it would be pretty useless.

  65. Re:Quantum computers were "5 years away"... in 197 by macs4all · · Score: 1

    What I am saying is that if there were any serious talk about quantum computers in 1972 then there's a good chance I'd have heard about it.

    Sorry, not this time...

    According to that esteemed, peer-reviewed (and CIA-owned) publication, Wired, David Deutsch is the father of Quantum Computing, and first postulated same "in the 1970s".

    In all fairness, I never heard about Quantum Computing until the 1990s; so what do I know?

  66. Re:Quantum computers were "5 years away"... in 197 by RockDoctor · · Score: 1

    Elementary failure of physics (or history) knowledge : Quantum computers were only seriously proposed in the early 1980s. Fiction authors may have used the term earlier, but without meaning.

    --
    Birds are not dinosaur descendants;birds are dinosaurs, for all useful meanings of "birds", "are" and "dinosaurs"
  67. Just five atoms? by marciot · · Score: 1

    Careful, make sure you don't lose it.

  68. Re:Quantum computers were "5 years away"... in 197 by KGIII · · Score: 1

    Yeah, it looks like some mention of it in the 60s (according to Wikipedia) and then not much of anything until the 1980s and it does look like Feynman was speculating about fifty years out (if I remember the talk well enough). So no, no serious discussion of it in the 1970s was speculating that it was five years out. At least not that I can find. Your link doesn't change that.

    --
    "So long and thanks for all the fish."
  69. Re:Quantum computers were "5 years away"... in 197 by Hylandr · · Score: 1

    Except that quantum states are potential realities until measured. Then reality is the only one that ever was with the exception that it's been observed by entities that give a shit about the *potential state* to begin with.

    --
    ~ People that think they are better than anyone else for any reason are the cause of all the strife in the world.
  70. Easy fix by Anonymous Coward · · Score: 0

    Someone better call Bill Gates quick and have him shut that darn quantum computer and stop those researchers at the border.