Tech News
← Back to articles

The JVG algorithm could break RSA-2048 encryption with fewer than 5k qubits

read original related products more articles

New Quantum Algorithm Warns of an Accelerated 'Crypto-Apocalypse'

AUSTIN, TX – March 02, 2026 – The digital locks securing global finance, government secrets, and the daily transactions of billions of people may be far more brittle than previously understood. Researchers at the Advanced Quantum Technologies Institute (AQTI) today announced a breakthrough algorithm that dramatically accelerates the timeline for a quantum computer to shatter the world’s most trusted encryption standards.

The announcement centers on the Jesse-Victor-Gharabaghi (JVG) algorithm, a novel method that re-engineers how a quantum computer can defeat RSA and ECC encryption—the cryptographic bedrock of the internet. For decades, these systems have been protected by a simple fact: the mathematical problems they are based on are too hard for even the most powerful conventional supercomputers to solve. The JVG algorithm, however, suggests a hybrid quantum approach could make this task feasible years, if not a decade, ahead of most official projections, creating an urgent, worldwide security challenge.

A New Blueprint for Code-Breaking

For years, the theoretical specter of quantum code-breaking has been personified by Shor's algorithm. While brilliant on paper, Shor's demands a large, fault-tolerant quantum computer with millions of stable quantum bits, or 'qubits'—a machine that most experts believe is still many years away. The JVG algorithm fundamentally changes this calculation.

Described by its creators as a hybrid strategy, the JVG method cleverly offloads much of the computational heavy lifting to classical supercomputers, leaving a smaller, more focused, and more manageable problem for the quantum device. The innovation lies in replacing a key component of Shor's algorithm with a more efficient process, reducing the number of qubits and quantum operations required by orders of magnitude.

According to the research manuscript, published on the preprint server Preprints.org, the new approach could allow a quantum computer to break the widely used RSA-2048 encryption standard with fewer than 5,000 qubits. This is a staggering reduction from the millions of qubits estimated for Shor's algorithm. The paper projects that with such a machine, factoring RSA-2048 could take as little as 11 hours. This transforms the threat from a distant, abstract possibility into a concrete engineering milestone that is much closer on the horizon.

The Race Against Time Heats Up

The AQTI announcement lands in the middle of a global, high-stakes effort to transition to Post-Quantum Cryptography (PQC)—a new generation of encryption designed to resist attacks from both classical and quantum computers. For years, government bodies have been sounding a quieter alarm, preparing for an eventual 'Q-Day' when quantum computers mature.

The U.S. National Institute of Standards and Technology (NIST), after a multi-year global competition, began finalizing the first PQC standards in August 2024. Government agencies like the Cybersecurity and Infrastructure Security Agency (CISA) and the National Security Agency (NSA) have already issued directives, urging federal agencies and critical infrastructure operators to inventory their vulnerable systems and prepare for the complex and costly migration.

... continue reading