A New Attack Easily Knocked Out a Potential Encryption Algorithm

In the US government’s ongoing campaign to protect data in the age of quantum computers , a new and powerful attack that used a single traditional computer to completely break a fourth-round candidate highlights the risks involved in standardizing the next generation of encryption algorithms. This story originally appeared on Ars Technica , a trusted source for technology news, tech policy analysis, reviews, and more. Ars is owned by WIRED’s parent company, Condé Nast.

Last month, the US Department of Commerce’s National Institute of Standards and Technology, or NIST, selected four post-quantum-computing encryption algorithms to replace algorithms like RSA, Diffie-Hellman, and elliptic curve Diffie-Hellman, which are unable to withstand attacks from a quantum computer. In the same move, NIST advanced four additional algorithms as potential replacements pending further testing in hopes one or more of them may also be suitable encryption alternatives in a post-quantum world. The new attack breaks SIKE, which is one of the latter four additional algorithms.

The attack has no impact on the four PQC algorithms selected by NIST as approved standards, all of which rely on completely different mathematical techniques than SIKE. SIKE—short for Supersingular Isogeny Key Encapsulation —is now likely out of the running, thanks to research that was published over the weekend by researchers from the Computer Security and Industrial Cryptography group at KU Leuven. The paper, titled “ An Efficient Key Recovery Attack on SIDH (Preliminary Version) ,” described a technique that uses complex mathematics and a single traditional PC to recover the encryption keys protecting the SIKE-protected transactions.

The entire process requires only about an hour’s time. The feat makes the researchers, Wouter Castryck and Thomas Decru, eligible for a $50,000 reward from NIST. “The newly uncovered weakness is clearly a major blow to SIKE,” David Jao, a professor at the University of Waterloo and co-inventor of SIKE, wrote in an email.

“The attack is really unexpected. ” The advent of public-key encryption in the 1970s was a major breakthrough because it allowed parties who had never met to securely trade encrypted material that couldn’t be broken by an adversary. Public-key encryption relies on asymmetric keys, with one private key used to decrypt messages and a separate public key for encrypting.

Users make their public key widely available. As long as their private key remains secret, the scheme remains secure. In practice, public-key cryptography can often be unwieldy, so many systems rely on key encapsulation mechanisms, which allow parties who have never met before to jointly agree on a symmetric key over a public medium such as the internet.

In contrast to symmetric-key algorithms, key encapsulation mechanisms in use today are easily broken by quantum computers. SIKE, before the new attack, was thought to avoid such vulnerabilities by using a complex mathematical construction known as a supersingular isogeny graph. The cornerstone of SIKE is a protocol called SIDH, short for supersingular isogeny Diffie-Hellman.

The research paper published over the weekend shows how SIDH is vulnerable to a theorem known as “glue-and-split” developed by mathematician Ernst Kani in 1997, as well as tools devised by fellow mathematicians Everett W. Howe, Franck Leprévost, and Bjorn Poonen in 2000. The new technique builds on what’s known as the “GPST adaptive attack,” described in a 2016 paper .

The math behind the latest attack is guaranteed to be impenetrable to most non-mathematicians. Here’s about as close as you’re going to get: “The attack exploits the fact that SIDH has auxiliary points and that the degree of the secret isogeny is known,” Steven Galbraith , a University of Auckland mathematics professor and the “G” in the GPST adaptive attack, explained in a short writeup on the new attack. “The auxiliary points in SIDH have always been an annoyance and a potential weakness, and they have been exploited for fault attacks, the GPST adaptive attack, torsion point attacks, etc.

” More important than understanding the math, Jonathan Katz, an IEEE member and professor in the department of computer science at the University of Maryland, wrote in an email: “The attack is entirely classical, and does not require quantum computers at all. ” SIKE is the second NIST-designated PQC candidate to be invalidated this year. In February, IBM postdoc researcher Ward Beullens published research that broke Rainbow , a cryptographic signature scheme with its security, according to Cryptomathic , “relying on the hardness of the problem of solving a large system of multivariate quadratic equations over a finite field.

” NIST’s PQC replacement campaign has been running for five years. Here’s a brief history: Rainbow fell during round 3. SIKE had made it until round 4.

Katz continued: It is perhaps a bit concerning that this is the second example in the past six months of a scheme that made it to the 3rd round of the NIST review process before being completely broken using a classical algorithm. (The earlier example was Rainbow, which was broken in February. ) Three of the four PQC schemes rely on relatively new assumptions whose exact difficulty is not well understood, so what the latest attack indicates is that we perhaps still need to be cautious/conservative with the standardization process going forward.

I asked Jao, the SIKE co-inventor, why the weakness had come to light only now, in a relatively later stage of its development. His answer was insightful. He said: It’s true that the attack uses mathematics which was published in the 1990s and 2000s.

In a sense, the attack doesn’t require new mathematics; it could have been noticed at any time. One unexpected facet of the attack is that it uses genus 2 curves to attack elliptic curves (which are genus 1 curves). A connection between the two types of curves is quite unexpected.

To give an example illustrating what I mean, for decades people have been trying to attack regular elliptic curve cryptography, including some who have tried using approaches based on genus 2 curves. None of these attempts has succeeded. So for this attempt to succeed in the realm of isogenies is an unexpected development.

In general there is a lot of deep mathematics which has been published in the mathematical literature but which is not well understood by cryptographers. I lump myself into the category of those many researchers who work in cryptography but do not understand as much mathematics as we really should. So sometimes all it takes is someone who recognizes the applicability of existing theoretical math to these new cryptosystems.

That is what happened here. The version of SIKE submitted to NIST used a single step to generate the key. A possible variant of SIKE could be constructed to take two steps.

Jao said that it’s possible that this latter variant might not be susceptible to the math causing this breakage. For now, though, SIKE is dead, at least in the current running. The schedule for the remaining three candidates is currently unknown.

This story originally appeared on Ars Technica . .