Podcast
Root Causes 434: Did Researchers Break AES Using Quantum Annealing?
Hosted by
Jason Soroko
Fellow
Original broadcast date
October 22, 2024
News reports claim Chinese researchers broke AES with a quantum annealing computer. We clarify the details and talk about the implications of this reported discovery.
Podcast transcript
TCTim CallanHow you doing today, Jason?
TCTim CallanSo, Jason, let me ask you a question. Did Chinese researchers use quantum annealing to break AES?
So let me set the stage for what I think really, really happened, and I'll let you put the color on top of it, which is way back in Root Causes Episode 37, you and I talked about the usage of quantum annealing and the fact that there was no equivalent Shor's algorithm for that type of quantum computing. But we expected it at some point. Well, guess what? Now we've seen it. Now we've seen it. Here's what really is going on, Tim. We were expecting way back in Episode 37 of this podcast, that a second front would be opened up. So it wouldn't just be a fully gated quantum computer along with Shor's algorithm, there would also be quantum annealing with another type of algorithm, and now we're finally seeing that.
TCTim CallanAnd quantum annealing has its own pros and cons. Like it's still a quantum computing method. It still takes advantage of quantum physics. From an engineering perspective, I'm given to understand it's easier, but it seems like the use cases for quantum annealing are extremely specific. Is that.
TCTim CallanBecause that's the problem. Qubit stability is the big bug bear here and if that becomes less of an issue for you, then presumably some of the engineering problems are mitigated.
TCTim CallanThis is something anybody who can afford the price tag can go by and D- wave has been around for a long time.
TCTim CallanAnd that's that part's really interesting. Because there's kind of been this built in assumption of, look, we don't really need to worry about AES. Like, Grover's algorithm can reduce the attack time, but not enough that anybody is really worried about it. And maybe we want bigger keys. Maybe we don't even care about bigger keys. I've heard the argument being made that don't even bother changing the keys, because it's all fine. If this could be something that was materially better than what we could see through Grover's algorithm, might there be a need to swap out AES as well?
TCTim CallanI think that's the question. If someone proof of concepts it on 22 bits, and then you say, look, it's just a matter of hard work to get up to a bit length we care about. That's one thing. It's a different thing if they can do it with 22 bits but that doesn't mean that we can extend that to something that's meaningful.
TCTim CallanDo you think, in light of this paper, which did get a decent amount of press pickup, which you understand why. It’s an exciting headline. Do you think that will spur research into quantum annealing, and where it fits into all of these potential cryptographic attacks?
TCTim CallanAbsolutely. Just contact me on LinkedIn, and we'd actually interview you on the program if you've got some something going on in this area. I think that would be interesting.
So if quantum annealing really is all about a different method of error handling, a different method - maybe a better way of saying it is quantum annealing is it really is all about taking into account the erosion of qubits. I would say that perhaps an even more interesting story from very recently has to do with some Eureka moments, some ah-ha moments about error handling. And I would say that that is probably one of the more interesting things that is going on right now with the usage of quantum computing error correction. And there's a really great article out there right now, Hybrid Quantum Error Correction Breakthrough Advances Quantum Computing, the Korea National Research Council of Science Technology published October 16, and it is going through Korean University and other researchers from other jurisdictions, and I won't get into the details, but what I would say is this - the advance in error correction for fully gated quantum computers will probably have more effect on whenever the Q date Zed date is than maybe the article that's getting more news right now, which is the Chinese using a quantum annealing computer. Just a final point on this is even IBM themselves, who uses a similar type of quantum computer that can apply this error correction breakthrough has changed their quantum computing roadmap, Tim, to not even concentrate so much on more stable qubits, but a more and longer stable set of qubits. And I find that to be a real world change for the positive in terms of quantum computing, and probably makes the advent of real quantum computers being able to utilize Shor's algorithm that much more reliable and usable. So very, very final point is, for those of you who are thinking quantum computing using Shor's algorithm is a boogey man that will never come, the arguments that I've heard for it is the lack of really good error correction and Tim, it seems like the Eureka moments to break that have now happened.
TCTim CallanThat's big. So it's interesting. The thing that has gotten a lot of attention probably isn't going to turn out to be significant but, in the meantime, the work on - I hate to use a word like traditional - but the work on just full-fledged quantum computing, that's where we're going to see the attacks against Shor's algorithm continuing.
TCTim CallanI think that's an interesting question. Maybe we can get a guest on who has a perspective on that. Thank you, Jason.
TCTim CallanThis has been Root Causes.