The new math of quantum encryption

The original version of this story appeared in How much magazine. I am

Hard issues are usually not a welcome view. But crippouribbi love them. Is because some math problems is hard under the security of modern encryption. Any cunning trick to solve them will make most of the encryption.

Many years ago, the researchers found a radically new approach to encryption that lack of this potential weak place. The approach exploiting particular features of quantum physics. But the contrary to the qualum schemans qualifies, that only one job for a few special tasks, the new approach can accomplish a large componing broad. And you could work even if all the problems at the heart of ordinary cryptumation “returns to be easily.

But this impressive findings concerned unrealistic hypothesis. The result was “more than a concept test”, he said It firm buta culting bleak in the institute simons for the compulsion theory in Berkeley, California. “It’s not a statement about real world.”

Now, a New Paper by two cryptographers placed a path to the asum cryptography without those outlandish suppose. “This card says that, if some other conjecture are true, then asum encryption should exist” but said.

Castle in the sky

You can think of modern crypographies as a tower with three essential parts. The file part is the deep Bed Bdrock under the tower, which is made of hard measures of hard. Tower was the second part-there can find you participate special procoramools you are leaving private messages, digital papers, cast digit

Within, ensure those applications of the day to the mathematical bed, it’s a foundation made of building blocks called functions a single way. I am Are responsible for inherent asymmetry in any encryption scheme. “It’s a way because you can encry the messages but you can’t decide”, “he said Branded zankudiaa cryptoger to the ntt search.

In the 80s 80s, researchers tried that cryptographic has built Own functions assured security for many different opinions. But decades later, they are not always sure the Bedrock is strong enough to support. The problem is that the Bedrock is made of difficult-technical issues – NP’s techniques and its function of definalition is that it is easy to check if any applicant is correct. (For example, break a number in their early bills is a problem NP: Hard to do for a big number, but easy to verify.)

Many of these issues seem intrinsically difficult, but the scientists of computer have not been able to try. I am If someone discover an engineer algorithm to quickly resolve hardest np problems, the bondock brurbine, and the whole tower will be rape.

Unfortunately, you can’t just move your tower elsewhere. Torre foundation foundations – can only sit on an NP problems bedock.

To build a tower on the hardest, encrypting issues would require a new foundation that is not made of a single-way functions. That seemed impossible until a few years ago, when researchers understood that physical asum could help.