Did Chinese Researchers Break Military Encryption?
No, military encryption remains secure. While sensational reports claimed RSA had fallen, Shanghai University researchers actually performed a proof-of-concept quantum annealing attack on small numbers up to 50 bits using a D-Wave annealer. Standard military-grade cryptography relies on 2048-bit or 4096-bit RSA keys and AES-256, which require exponentially more resources. See the mathematical scale comparison below →
Recent media headlines claimed that Chinese researchers had “broken military-grade encryption” using a quantum computer. A technical review of the published paper reveals that the research was an academic experiment in hybrid quantum annealing optimization, not a cryptographic compromise of production encryption standards.
| Cryptographic Benchmark & Key Space | Hardware & Method Used | Real-World Security Status |
|---|---|---|
| Shanghai Univ. Experiment (22–50 bits) | D-Wave Advantage annealer (QUBO mapping) | Toy benchmark; fundamentally cannot scale to commercial crypto |
| Commercial SSL / TLS (RSA-2048) | Requires universal fault-tolerant Shor algorithm | Unbroken; requires millions of physical error-corrected qubits |
| Military / High Security (RSA-4096) | Requires massive universal fault-tolerant Shor circuit | Unbroken; decades away from physical realization |
| Symmetric Encryption (AES-256) | Grover’s search (square root reduction to 128-bit) | Quantum-resistant; completely unbreakable against known physics |
Read the community discussion and expert analysis at Slashdot: Debunking Hype: China Hasn’t Broken Military Encryption with Quantum.
Can quantum annealers run Shor’s algorithm?
No. Quantum annealers (such as D-Wave) solve quadratic unconstrained binary optimization (QUBO) problems via adiabatic evolution. They lack the phase estimation, coherent gate control, and error correction required to execute Shor’s algorithm for factoring large primes.
How far was the tested integer from breaking RSA-2048?
The researchers factored an integer of approximately 50 bits. Because RSA difficulty scales super-polynomially on classical computers and requires 2048 bits for commercial encryption, an attack on 50 bits is more than 10600 times smaller than the keys protecting global financial transactions.
Leave a Reply