BenchmarksStack Ranking
APIsPricingDocsWhite PaperTokenBlogAboutSecurity Demo
Log InGet API Key
Post-Quantum · 5 min read

When Will Quantum Computers Break Encryption?
A Realistic Timeline

Expert analysis on when quantum computers will pose a real threat to current cryptographic systems and what you should do now.

FIPS 204
Standard
~240µs
Verify
128-bit
PQ Security
3
Algorithms

The question isn't whether quantum computers will break current encryption—it's when. Security experts debate timelines ranging from 5 to 30 years, but one thing is certain: organizations need to prepare now. Let's examine the realistic timeline and what it means for your security strategy.

Current State of Quantum Computing

As of early 2026, the most powerful quantum computers have around 1,000-1,500 qubits. IBM, Google, and others continue making steady progress. However, there's a crucial distinction between physical qubits and logical qubits:

Breaking RSA-2048 requires approximately 4,000 logical qubits. Current error correction ratios suggest this needs millions of physical qubits—a significant engineering challenge. The best surface-code estimates place the overhead at roughly 1,000 to 3,000 physical qubits per logical qubit, depending on the target gate error rate. That puts a cryptographically relevant quantum computer (CRQC) in the range of 4 to 12 million physical qubits—well beyond the hardware available today.

Key Insight

Shor's algorithm is efficient in theory, but it demands sustained, fault-tolerant computation across thousands of logical qubits for minutes to hours. A single decoherence event in the wrong place collapses the computation. The engineering gap between "noisy intermediate-scale" and "fault-tolerant" is where the real uncertainty lives.

Expert Timeline Predictions

Various experts and organizations have offered predictions:

Timeline Estimates

Optimistic (for attackers): 5-10 years
Moderate consensus: 10-15 years
Conservative: 15-30 years
NSA guidance: Transition by 2035

The Global Risk Institute surveys quantum computing experts annually. Their 2025 survey found a median estimate of 15% probability of cryptographically relevant quantum computers by 2030, rising to 50% by 2035.

Which Algorithms Are Vulnerable?

Not all cryptography is equally at risk. Shor's algorithm threatens asymmetric (public-key) schemes, while Grover's algorithm weakens symmetric ciphers by effectively halving their key length. The practical impact varies dramatically by algorithm family:

AlgorithmTypeQuantum AttackImpact
RSA-2048AsymmetricShor'sFully broken
ECDSA / P-256AsymmetricShor'sFully broken
Diffie-HellmanKey exchangeShor'sFully broken
AES-128SymmetricGrover'sReduced to 64-bit security
AES-256SymmetricGrover'sReduced to 128-bit — still safe
SHA-256HashGrover'sReduced to 128-bit — still safe
Dilithium (ML-DSA)PQ SignatureNone knownQuantum-resistant
Kyber (ML-KEM)PQ Key Encap.None knownQuantum-resistant

The critical takeaway: every TLS handshake, JWT signature, and API token that relies on RSA or elliptic curves becomes forgeable or decryptable once a CRQC exists. Symmetric primitives at 256-bit key lengths remain safe, but they protect data at rest—not authentication, key exchange, or digital signatures.

The "Harvest Now, Decrypt Later" Threat

Perhaps more concerning than the timeline itself is the "harvest now, decrypt later" attack vector. Adversaries—including nation-states—are already collecting encrypted data with the intention of decrypting it once quantum computers are available.

Consider data with long-term sensitivity:

If your data has value beyond 5-10 years, it's already at risk from future quantum attacks. Intelligence agencies with petabyte-scale storage can intercept encrypted traffic today, archive it cheaply, and retroactively decrypt the entire corpus once the hardware matures. The effective threat window is not "when CRQCs arrive" but "now, minus the sensitivity lifetime of your data."

What's Driving Progress?

Several factors are accelerating quantum computing development:

Why Start Migration Now?

Even with a 10-15 year timeline, starting your post-quantum migration today is essential:

Post-Quantum Cryptography Is Production-Ready Today

The common objection to early migration is performance: lattice-based algorithms are assumed to be slower or more resource-intensive than classical alternatives. That assumption is outdated. NIST finalized FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), and FIPS 205 (SLH-DSA) in 2024, and optimized implementations are already running in production.

H33's authentication stack demonstrates that post-quantum security imposes negligible overhead when the implementation is engineered correctly. The full pipeline—BFV fully homomorphic encryption over a lattice with polynomial degree N=4096, ZKP verification via STARK lookups, and Dilithium signature attestation—completes in approximately 42 microseconds per authentication. At scale, this sustains 2,172,518 authentications per second on a single Graviton4 instance.

Key Insight

Post-quantum does not mean post-performance. H33 batches 32 users into a single BFV ciphertext using SIMD slot packing (4096 slots / 128 biometric dimensions = 32 users per ciphertext). The entire batch—FHE inner product, ZKP lookup, and Dilithium sign+verify—completes in ~1,356 microseconds. That is roughly 42 microseconds per user, well under the latency of a typical TLS handshake.

The key architectural decisions that make this possible include Montgomery-form NTT arithmetic with Harvey lazy reduction (eliminating modular division from the hot path), NTT-domain fused inner products (one final INTT instead of per-chunk transforms), and batch Dilithium attestation (one signature operation per 32-user batch rather than per individual). These are engineering optimizations, not theoretical shortcuts—they preserve the full lattice-based security guarantees while eliminating computational waste.

// H33 single API call — full post-quantum auth pipeline
// BFV FHE (N=4096, t=65537) + ZKP STARK + Dilithium-5
POST /v1/auth/verify
Authorization: Bearer h33_pk_...
Content-Type: application/json

{
  "batch": ["user_001", "user_002", ... "user_032"],
  "templates_ct": "<BFV ciphertext, 32 SIMD slots>",
  "probes_ct":    "<BFV ciphertext, 32 SIMD slots>"
}

// Response: ~1,356µs for 32 users (~42µs per auth)
// Dilithium-signed attestation included
{
  "matches": [true, true, false, ...],
  "attestation": "<ML-DSA-65 signature>",
  "zkp_proof_id": "stark_lookup_0x7f3a..."
}

Recommended Actions

Regardless of the exact timeline, these steps will prepare your organization:

The quantum threat timeline may be uncertain, but the need to act is not. The mathematics are settled, the standards are finalized, and production-grade implementations exist today. Organizations that begin their post-quantum journey now will be best positioned to weather the quantum transition, whenever it arrives.

Ready to Go Quantum-Secure?

Start protecting your users with post-quantum authentication today. 1,000 free auths, no credit card required.

Get Free API Key →

Build With Post-Quantum Security

Enterprise-grade FHE, ZKP, and post-quantum cryptography. One API call. Sub-millisecond latency.

Get Free API Key → Read the Docs
Free tier · 10,000 API calls/month · No credit card required
Verify It Yourself