Proposed Quantum Algorithm Shows Fatal Flaw in Approach to RSA Encryption

A recently circulated quantum computing paper claiming breakthrough improvements to cryptographic security has drawn sharp criticism from experts in the field. The work, which proposes what its authors call the Jesse-Victor-Gharabaghi algorithm, suggests it could break RSA-2048 encryption using just 5,000 physical quantum bits—a dramatic reduction from previous estimates.

The core innovation claimed by the researchers involves modifying a crucial component of Shor’s famous factoring algorithm. Instead of computing exponential operations within quantum superposition states, the proposed method suggests performing these calculations on classical computers first, then transferring the results into quantum memory.

However, computational experts quickly identified a fundamental mathematical error that renders the approach impractical. The problem lies in the exponential scaling of the preprocessing requirements. While the authors avoid one computational bottleneck, they create an even more severe limitation in the classical preparation phase.

The preprocessing step requires calculating and storing an exponentially large number of values, which demands exponential time on classical computers. Additionally, loading this massive dataset into quantum memory also scales exponentially with problem size. This means the algorithm only appears advantageous when tested on trivially small numbers, but becomes computationally impossible for real-world cryptographic applications.

Multiple analysis posts from quantum computing communities have highlighted these same fundamental flaws. The consensus among experts is that while trading quantum computation for classical preprocessing could theoretically offer advantages, this particular implementation fails to achieve meaningful improvements.

The incident highlights a common pitfall in algorithm design where researchers attempt to hide computational complexity in preprocessing steps. This approach can create misleading performance claims when algorithms are only tested on small-scale problems that don’t reveal the exponential scaling issues.

Legitimate quantum algorithms research has explored similar preprocessing concepts successfully. Previous work has demonstrated methods to parallelize portions of Shor’s algorithm using preprocessing techniques, but these approaches carefully account for the computational tradeoffs involved.

The controversy also raises questions about research practices, including the tendency for authors to name algorithms after themselves and the importance of thorough peer review in identifying fundamental algorithmic flaws before publication.