Resource Estimates for Quantum Discrete Logarithm Computations on 256-bit Elliptic Curves
quantumcomputingreport.com Mar 27, 2026

Resource Estimates for Quantum Discrete Logarithm Computations on 256-bit Elliptic Curves

AI-summarised brief · reviewed before publication

Researchers have developed a method to solve the Discrete Logarithm problem on 256-bit elliptic curves using 1,098 logical qubits, a reduction from previous estimates of 2,124. This approach utilizes a space-optimized implementation of Shor's algorithm, achieving a space complexity of 3.12n for an n-bit curve, and reduces the qubit requirement below that of factoring 3072-bit RSA, making it a viable path for early fault-tolerant systems with limited logical qubits.