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.
| Physical error rate | Hardware | Code distance | Physical qubits | Runtime |
|---|---|---|---|---|
| 0.1% | superconducting, 1 µs | 31 | 6.49 million - 9.85 million | 46.3 days |
| 0.05% | superconducting, 1 µs | 23 | 3.57 million - 5.42 million | 34.3 days |
| 0.01% | superconducting, 1 µs | 15 | 1.52 million - 2.31 million | 22.4 days |
| 0.001% | superconducting, 1 µs | 9 | 546,750 - 830,412 | 13.4 days |
| 0.1% | trapped ion, 200 µs | 31 | 6.49 million - 9.85 million | 25.3 years |
| 0.05% | trapped ion, 200 µs | 23 | 3.57 million - 5.42 million | 18.8 years |
| 0.01% | trapped ion, 200 µs | 15 | 1.52 million - 2.31 million | 12.3 years |
| 0.001% | trapped ion, 200 µs | 9 | 546,750 - 830,412 | 7.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.