Will the quantum encryption become a joke after a 10-year-old desktop computer breaks it in 4 minutes?
Will the quantum encryption algorithm become a joke after a 10-year-old desktop computer breaks it in 4 minutes?
- Why Enterprise RAID Rebuilding Succeeds Where Consumer Arrays Fail?
- Linus Torvalds Rejects MMC Subsystem Updates for Linux 7.0: “Complete Garbage”
- The Man Who Maintained Sudo for 30 Years Now Struggles to Fund the Work That Powers Millions of Servers
- How Close Are Quantum Computers to Breaking RSA-2048?
- Why Windows 10 Users Are Flocking to Zorin OS 18 Instead of Linux Mint?
- How to Prevent Ransomware Infection Risks?
- What is the best alternative to Microsoft Office?
Will the quantum encryption algorithm become a joke after A 10-year-old desktop computer breaks it in 4 minutes?
A Decade-Old Computer Breaks 12-Year-Old Encryption Standard
In a development that has sent shockwaves through the cryptography community, two researchers from KU Leuven have successfully cracked SIKE, a prominent quantum-resistant encryption algorithm that had remained secure for 12 years.
The breach took just 4 minutes using a 10-year-old desktop computer.
Linux Disk Encryption: A Comprehensive Guide to BitLocker Alternatives
The Breakthrough
The SIKE (Supersingular Isogeny Key Encapsulation) algorithm was considered a leading candidate for post-quantum cryptographic standards. It was among four algorithms shortlisted by the National Institute of Standards and Technology (NIST) as candidates for the next round of post-quantum cryptography (PQC) standardization.
The researchers accomplished what seemed impossible:
- Initial key extraction: 4 minutes
- Complete algorithm breach: 62 minutes
- Hardware used: Single CPU core on a decade-old desktop
IBM Advances Toward Quantum Advantage with New Nighthawk Processor Set for 2025 Release
Why Post-Quantum Cryptography Matters
The rise of quantum computing poses an existential threat to traditional encryption methods. Classical algorithms like RSA, which would take 80 years to crack using conventional methods, can be broken by quantum computers in approximately 8 hours through brute-force attacks.
This vulnerability has driven the development of post-quantum cryptography—encryption methods designed to withstand attacks from both classical and quantum computers.
How Close Are Quantum Computers to Breaking RSA-2048?
How SIKE Works
SIKE is built on elliptic curve cryptography, using mathematical structures that can be expressed as y² = x³ + Ax + B, where A and B are constants.
The algorithm employs isogenies—mappings between elliptic curves—through the Supersingular Isogeny Diffie-Hellman (SIDH) protocol. The process works as follows:
The Key Exchange Process:
- Two parties, Alice and Bob, represent different graphs with identical points but different edges
- Each point represents a distinct elliptic curve
- Edges between points represent isogenic relationships
- Both parties start from the same point and traverse their respective graphs along secret paths
- They announce their intermediate endpoints publicly while keeping their paths secret
- Each party then follows their secret path from the other’s announced endpoint
- Both arrive at the same final point, which becomes their shared encryption key
The security relied on the computational difficulty of determining the secret paths even when knowing the intermediate points.
China Telecom Achieves 100km Quantum Transmission Record
The Achilles’ Heel
SIKE’s vulnerability stemmed from a required feature: auxiliary torsion points—additional information beyond the publicly exchanged endpoints. Previous attack attempts had targeted this information, but none succeeded until now.
The Mathematical Solution
On August 5, researchers Thomas Decru and Wouter Castryck published their breakthrough method. Their approach leveraged a 25-year-old mathematical theorem by Ernst Kani from 1997.
The Cracking Method:
- They calculated the product of Alice’s starting elliptic curve and the curve exposed to Bob
- This produced an Abelian surface (a higher-dimensional mathematical object)
- Using Kani’s theorem linking Abelian surfaces to elliptic curves
- Combined with auxiliary torsion point information
- They successfully derived the shared secret key
Despite elliptic curves being one-dimensional objects, they can be represented in higher dimensions mathematically, enabling the creation of these critical mapping relationships.
IBM’s Quantum Leap: AMD Chips Run Error Correction 10x Faster Than Expected
Expert Reactions
The cryptography community has responded with a mixture of surprise and appreciation for the mathematical elegance of the attack.
Christopher Peikert, encryption algorithm expert, noted that SIKE’s 12-year resistance to attacks was remarkable, as most encryption proposals face immediate cracking attempts.
Steven Galbraith, University of Auckland mathematician, emphasized that the breakthrough underscores the critical importance of fundamental mathematical theory in cryptographic research.
David Jao, SIKE co-creator and University of Waterloo professor, expressed mixed feelings: “Although at first I was sad that SIKE was broken, this method of breaking through math is really cool.” He added that he’s grateful the vulnerability was discovered before widespread deployment.
Google Unveils “Quantum Echoes” Algorithm: A Breakthrough Toward the “Quantum Microscope”
Implications and Industry Response
NIST’s decision not to include SIKE in the initial PQC standard now appears prescient. The organization had expressed concerns about insufficient analysis and potential major vulnerabilities.
Tech giants including Microsoft and Amazon have launched re-evaluations of SIKE and related cryptographic systems in light of this breakthrough.
Quantum Computers Will Break Today’s Encryption And Hackers Are Already Preparing
Related Developments
SIKE isn’t the only PQC candidate to fall this year. In February, IBM Research scientist Ward Beullens cracked another NIST candidate, the Rainbow algorithm, using just a laptop over a weekend (53 hours of computation).
However, other isogeny-based encryption methods, including CSIDH and SQIsign, remain unbroken and continue to be studied as potential quantum-resistant alternatives.
Why PQC Encryption Technology Can Resist Quantum Computing Decryption
The Takeaway
This incident highlights a fundamental truth in cryptography: mathematical foundations matter immensely. A quarter-century-old theorem proved to be the key to unraveling a modern encryption standard thought to be secure against even quantum computers.
As the race for quantum-resistant cryptography continues, the SIKE breach serves as a reminder that thorough mathematical analysis and extended scrutiny are essential before widespread adoption of any new cryptographic standard.

Will the quantum encryption become a joke after A 10-year-old desktop computer breaks it in 4 minutes?
Reference link:
[1] https://spectrum.ieee.org/quantum-safe-encryption-hacked
[2] https://www.degruyter.com/document/doi/10.1515/crll.1997.485.93/html
[3] https://eprint.iacr.org/2022/214
[4] https://www.quantamagazine.org/post-quantum-cryptography-scheme-is-cracked-on-a-laptop-20220824/