## Cryptology ePrint Archive: Report 2017/598

Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms

Martin Roetteler and Michael Naehrig and Krysta M. Svore and Kristin Lauter

Abstract: We give precise quantum resource estimates for Shor's algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate network for controlled elliptic curve point addition, implemented within the framework of the quantum computing software tool suite LIQ$Ui|\rangle$. We determine circuit implementations for reversible modular arithmetic, including modular addition, multiplication and inversion, as well as reversible elliptic curve point addition. We conclude that elliptic curve discrete logarithms on an elliptic curve defined over an $n$-bit prime field can be computed on a quantum computer with at most $9n + 2\lceil\log_2(n)\rceil+10$ qubits using a quantum circuit of at most $448 n^3 \log_2(n) + 4090 n^3$ Toffoli gates. We are able to classically simulate the Toffoli networks corresponding to the controlled elliptic curve point addition as the core piece of Shor's algorithm for the NIST standard curves P-192, P-224, P-256, P-384 and P-521. Our approach allows gate-level comparisons to recent resource estimates for Shor's factoring algorithm. The results also support estimates given earlier by Proos and Zalka and indicate that, for current parameters at comparable classical security levels, the number of qubits required to tackle elliptic curves is less than for attacking RSA, suggesting that indeed ECC is an easier target than RSA.

Category / Keywords: public-key cryptography / Quantum cryptanalysis, elliptic curve cryptography, elliptic curve discrete logarithm problem.

Original Publication (in the same form): IACR-ASIACRYPT-2017

Date: received 20 Jun 2017, last revised 30 Oct 2017

Contact author: mnaehrig at microsoft com

Available format(s): PDF | BibTeX Citation

Short URL: ia.cr/2017/598

[ Cryptology ePrint archive ]