How a new code cracks encryption with fewer qubits

HostWe use secret codes for almost everything online, from checking our bank accounts to sending private texts. For a long time, we felt pretty safe because the math behind those locks is so hard that even the most powerful computers would take trillions of years to crack them. But there's a lot of talk lately about how a new math shortcut could change everything. Is this new code really going to let a smaller computer break into our secrets much sooner than we thought?

GuestIt definitely changes the timeline we were working with. To understand why, you have to look at how our digital locks actually work. Right now, most of them rely on one big math problem: it's very easy to multiply two massive prime numbers together, but it's nearly impossible to do the reverse. If I give you a number that's hundreds of digits long and ask you which two primes made it, a normal computer has to just guess and check. It would take longer than the age of the universe to finish. Back in the nineties, a researcher named Peter Shor showed that a quantum computer could solve this problem much faster. But his method—which we call Shor's code—needs a giant machine with millions of quantum bits to work. Since today’s quantum computers only have a few hundred bits, we figured we had plenty of time before our encryption was in real trouble. But this new code from a math expert named Oded Regev flips that. He found a way to use a different kind of math to find the answer with far fewer steps.

HostWait, I'm trying to wrap my head around that. How does a math trick on paper actually change the size of the computer you need? Usually, a smart plan just saves you time, it doesn't make the machine physically smaller.

GuestWell, in the quantum world, time and size are tied together. Think of the old way like a scavenger hunt where you have to walk every single inch of a massive field to find a hidden key. To do that quickly, you would need a huge crowd of people—those are your quantum bits—all walking at the same time. Regev’s new code is more like standing on a high tower and looking at the field from a dozen different directions at once. He uses what mathematicians call a grid, or a lattice. By looking for patterns in that grid across many directions, the computer can spot the answer without having to walk over every inch of the field. Because the plan is so much more efficient, the computer doesn't have to stay stable for nearly as long. It cuts down the number of logical steps the machine has to take by a huge amount. Specifically, if a number has a certain number of digits, the old way might take that number multiplied by itself in steps. This new way takes that number, but instead of squaring it, it uses a much smaller power. When you're talking about numbers with thousands of digits, that shortcut is massive. It means a machine that's way less powerful than we thought could suddenly be a threat.

HostBut there's always a catch with these kinds of shortcuts, right? I mean, if you're looking from a tower instead of walking the field, you still need to build the tower. Is there a hidden cost to this new code that makes it hard to use?

GuestYou hit on the exact problem. There's a very real trade-off here. While the code needs fewer steps to get the answer, it needs a lot more quantum memory. In a normal laptop, memory is cheap and easy. But in a quantum computer, memory is the hardest thing to build. It's incredibly difficult to keep quantum information from just vanishing into thin air. Regev’s plan requires the computer to store and juggle a lot of data while it looks for those patterns in the grid. So, we have traded one problem for another. We don't need a machine that can run for a long time, but we do need a machine that has a much better way to hold onto information without making mistakes. It's a bit like having a car that can go twice as fast but needs a road that's perfectly smooth. If there's even one tiny bump, the whole thing crashes. We're still not sure which is harder to build: the giant machine the old way needed, or the very precise, high-memory machine this new way needs.

HostSo it's not like our bank accounts are going to be wide open by tomorrow morning. It sounds like we just swapped a mountain of work for a different mountain of work.

GuestThat's a fair way to put it, but the new mountain might be a lot easier to climb. The real shift is that we can no longer just sit back and wait for the hardware to get bigger. For years, the safety of our digital world was based on a guess about how long it would take to build a massive quantum computer. Now we know that a clever person with a pen and paper can find a shortcut that makes the hardware size matter much less. It's putting a lot of pressure on governments and banks to switch to new kinds of secret codes right now—codes that use math problems which don't have these kinds of grid-based shortcuts. The scary part is that even if a computer can't break your data today, someone could be stealing and saving your encrypted files right now, just waiting for the day they have a machine that can run this new code. They're playing the long game.

HostIt's wild to think that a simple change in how we look at a grid could make the locks on our phones feel so much more fragile.

GuestThe real lesson is that in the world of secret codes, the math often moves much faster than the machines.

HostOur digital world stays safe as long as the math stays hard, but as we're seeing, a clever new perspective can make the impossible look a lot more likely.