Quantum Resource Estimator

ECC P-256: what Shor's discrete-log attack would cost

256-bit elliptic curves (NIST P-256, and secp256k1 used by Bitcoin) secure most TLS handshakes and cryptocurrency signatures. Shor's algorithm solves the elliptic-curve discrete log with fewer logical qubits than RSA-2048 needs, which is why ECC is often expected to fall first.

How many qubits does it take to break 256-bit elliptic curve cryptography?

Using 2,330 logical qubits and 129 billion Toffoli gates, a surface-code machine at 0.1% physical error and 1 microsecond cycles needs code distance 31, about 6.49 million - 9.85 million physical qubits, and runs for about 46.3 days (serial depth). Order-of-magnitude planning estimate.

Precomputed with model version 2: 33% error budget, serial T-depth. Source: Roetteler, Naehrig, Svore & Lauter 2017 (arXiv:1706.06752): 9n + 2 log2 n + 10 = 2,330 logical qubits and (448 log2 n + 4090) n^3 = 1.29e11 Toffoli gates for n = 256. Later work (e.g. Litinski 2023) cuts the gate count substantially. Serial depth.
Physical error rateHardwareCode distancePhysical qubitsRuntime
0.1%superconducting, 1 µs316.49 million - 9.85 million46.3 days
0.05%superconducting, 1 µs233.57 million - 5.42 million34.3 days
0.01%superconducting, 1 µs151.52 million - 2.31 million22.4 days
0.001%superconducting, 1 µs9546,750 - 830,41213.4 days
0.1%trapped ion, 200 µs316.49 million - 9.85 million25.3 years
0.05%trapped ion, 200 µs233.57 million - 5.42 million18.8 years
0.01%trapped ion, 200 µs151.52 million - 2.31 million12.3 years
0.001%trapped ion, 200 µs9546,750 - 830,4127.36 years

Try your own assumptions

Physical qubits (total)
Estimated runtime
Code distance
Data-block physical qubits
T-gate count
Physical per logical

Highlighted share: magic-state factories (conservative bound shown).

How the model works and where every constant comes from: methodology and sources.