[2606.02235] Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms

-->

Quantum Physics

arXiv:2606.02235 (quant-ph)

[Submitted on 1 Jun 2026]

Title:Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms

Authors:André Schrottenloher<br>View a PDF of the paper titled Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms, by Andr\'e Schrottenloher

View PDF<br>HTML (experimental)

Abstract:Shor's algorithm represents the main threat of quantum computers to cryptography. In order to precisely understand its feasibility, many authors have worked towards reducing its costs, either at the logical level (assuming a fault-tolerant architecture), or at the physical level (taking into account the constraints of envisioned hardware). In particular, recent works by Chevignard et al. (CRYPTO 2024) and Gidney (arXiv 2025) used improved arithmetic to significantly reduce the qubit cost of factoring RSA public keys.

Even more recently, Babbush et al. (arXiv 2026) improved the cost of computing elliptic curve discrete logarithms, with a reduction of a factor 2 to 3 in gate count and qubit count compared to a previous work by Litinski (arXiv 2023). Their result relies on optimized point addition circuits on elliptic curves over prime fields. However they did not reveal their logical quantum circuits, relying instead on a zero-knowledge proof.

In this paper, we detail a quantum logical circuit architecture which gives similar results as Babbush et al., with a slightly higher number of qubits (around 1.5% increase) and a slightly smaller Toffoli gate count (between 6.5% and 10% reduction) for the curve secp256k1. We also give gate counts for a generic variant of the circuit, which is valid for any prime field.

Subjects:

Quantum Physics (quant-ph)

MSC classes:<br>68Q12

Cite as:<br>arXiv:2606.02235 [quant-ph]

(or<br>arXiv:2606.02235v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2606.02235

Focus to learn more

arXiv-issued DOI via DataCite (pending registration)

Submission history<br>From: André Schrottenloher [view email]<br>[v1]<br>Mon, 1 Jun 2026 13:29:30 UTC (31 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms, by Andr\'e Schrottenloher<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

quant-ph

next >

new<br>recent<br>| 2026-06

References & Citations

INSPIRE HEP

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)