Resource Estimates for Quantum Discrete Logarithm Computations on 256-bit Elliptic Curves
A technical paper by Clémence Chevignard, Pierre-Alain Fouque, and André Schrottenloher, scheduled for EUROCRYPT 2026, describes a method to solve the Discrete Logarithm problem on 256-bit elliptic curves (ECDLP) using 1,098 logical qubits. This is a reduction from previous estimates of 2,124 logical qubits for the same security level. The approach utilizes a space-optimized implementation […]
The post Resource Estimates for Quantum Discrete Logarithm Computations on 256-bit Elliptic Curves appeared first on Quantum Computing Report.
Click to rate this post!
[Total: 0 Average: 0]
You have already voted for this article
(Visited 2 times, 2 visits today)