# New JVG Quantum Decryption Algorithm Could Pose Risk to Classical Encryption

**URL:** https://discuss.privacyguides.net/t/new-jvg-quantum-decryption-algorithm-could-pose-risk-to-classical-encryption/36042
**Category:** News
**Created:** 2026-03-06T19:50:38Z
**Posts:** 3

## Post 1 by @fria — 2026-03-06T19:50:39Z

A new quantum decryption algorithm called [JVG](https://www.securityweek.com/quantum-decryption-of-rsa-is-much-closer-than-expected/) could significantly reduce the amount of resources needed to decrypt classical RSA encryption that we’ve been relying on for decades.

* * *
This is a companion discussion topic for the original entry at [https://www.privacyguides.org/news/2026/03/06/new-jvg-quantum-decryption-algorithm-could-pose-risk-to-classical-encryption](https://www.privacyguides.org/news/2026/03/06/new-jvg-quantum-decryption-algorithm-could-pose-risk-to-classical-encryption)

---

## Post 2 by @securitybrahh — 2026-03-07T01:16:21Z

> The JVG algorithm requires thousand-fold less quantum computer resources, such as qubits and quantum gates. Research extrapolations suggest it will require less than 5,000 qubits to break encryption methods used in RSA and ECC.

This was in 2020

> **[D-Wave launches its 5,000+ qubit Advantage system | TechCrunch](https://techcrunch.com/2020/09/29/d-wave-launches-its-5000-qubit-advantage-system/)**
>
> D-Wave today announced the launch of its new Advantage quantum computers. These new systems, with over 5,000 qubits and 15-way qubit connectivity, are now

---

## Post 3 by @maqp — 2026-03-07T21:28:18Z

DWave has 5,000 physical qubits. As per [[2105.02208] Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems](https://arxiv.org/abs/2105.02208) that’s about 120 logical qubits.

You need \<5,000 logical qubits for JVG.

* * *

> **[Integer factorization records | Records for efforts by quantum computers](https://en.wikipedia.org/wiki/Integer_factorization_records#Records_for_efforts_by_quantum_computers)**
>
> The largest number reliably factored by Shor's algorithm, rather than some other quantum method, is 21 which was factored in 2012. The number 15 had previously been factored by several labs and subsequent attempts to factorise 35 failed.
> Other methods have been used to factorise specific numbers on quantum computers. In April 2012, the factorization of 143 = 13 × 11 by a room-temperature (300 K) NMR adiabatic quantum computer was reported by a group. In November 2014 it was discovered that the ...

shows no number larger than 21 has yet been factored with Shor’s algorithm. No larger number than 8,219,999 has been factored by classical+quantum algorithms.

Wake me up when they factor the smallest usable, [RSA-2048 semiprime challenge](https://en.wikipedia.org/wiki/RSA_numbers#RSA-2048):

25195908475657893494027183240048398571429282126204032027777137836043662020707595556264018525880784406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971824691165077613379859095700097330459748808428401797429100642458691817195118746121515172654632282216869987549182422433637259085141865462043576798423387184774447920739934236584823824281198163815010674810451660377306056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467962926386356373289912154831438167899885040445364023527381951378636564391212010397122822120720357

So yeah, an improvement, but nowhere near what’s needed to break RSA. Still, the days are numbered so try to migrate to post-quantum suites where possible.

EDIT: [Shtetl-Optimized » Blog Archive » The ”JVG algorithm” is crap](https://scottaaronson.blog/?p=9615) seems to debunk the algorithm.