• Home
  • Search
  • Improved Quantum Circuits for Elliptic Curve Discrete Logarithms
  • Open Access IconOpen Access
  • Cite Icon76
  • https://doi.org/10.1007/978-3-030-44223-1_23Copy DOI Icon

Improved Quantum Circuits for Elliptic Curve Discrete Logarithms

  • Jan 1, 2020
  • Thomas Häner +4 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present improved quantum circuits for elliptic curve scalar multiplication, the most costly component in Shor’s algorithm to compute discrete logarithms in elliptic curve groups. We optimize low-level components such as reversible integer and modular arithmetic through windowing techniques and more adaptive placement of uncomputing steps, and improve over previous quantum circuits for modular inversion by reformulating the binary Euclidean algorithm. Overall, we obtain an affine Weierstrass point addition circuit that has lower depth and uses fewer T gates than previous circuits. While previous work mostly focuses on minimizing the total number of qubits, we present various trade-offs between different cost metrics including the number of qubits, circuit depth and T-gate count. Finally, we provide a full implementation of point addition in the Q# quantum programming language that allows unit tests and automatic quantum resource estimation for all components.

Similar Papers
  • Conference Article
  • Citations19

An implementation of ElGamal elliptic curves cryptosystems

  • Nov 24, 1998
  • S Sutikno +2
  • Research Article
  • Citations154

Message recovery for signature schemes based on the discrete logarithm problem

  • Jan 01, 1996
  • Designs, Codes and Cryptography
  • Kaisa Nyberg +1
  • Research Article
  • Citations22

Tracking quantum error correction

  • Aug 22, 2018
  • Physical Review A
  • Kosuke Fukui +2
  • Book Chapter
  • Citations200

Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms

  • Jan 01, 2017
  • Martin Roetteler +3
  • PDF
  • Book Chapter
  • Citations6

Elliptic Curve Cryptography and Point Counting Algorithms

  • Mar 07, 2012
  • Hailiza Kamarulhaili +1
  • Research Article
  • Citations86

Factoring using 2n+2 qubits with Toffoli based modular multiplication

  • May 01, 2017
  • Quantum Information and Computation
  • Thomas Haner +2
  • Conference Article
  • Citations8

Approximate Ternary Quantum Error Correcting Code with Low Circuit Cost

  • Nov 01, 2020
  • Ritajit Majumdar +1
  • Research Article
  • Citations130

Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems

  • Jul 30, 2004
  • Journal of Cryptology
  • Eric R Verheul
  • PDF
  • Research Article
  • Citations1

Dictionary-based Block Encoding of Sparse Matrices with Low Subnormalization and Circuit Depth

  • Jul 22, 2025
  • Quantum
  • Chunlin Yang +5
  • Research Article
  • Citations4

$$\Lambda $$-submodules of finite index of anticyclotomic plus and minus Selmer groups of elliptic curves

  • Feb 18, 2021
  • manuscripta mathematica
  • Jeffrey Hatley +2
  • Book Chapter
  • Citations302

Quantum Error Correction

  • Feb 28, 2020
  • Todd A Brun
  • Conference Article
  • Citations341

Reducing elliptic curve logarithms to logarithms in a finite field

  • Jan 01, 1991
  • Alfred Menezes +2
  • PDF
  • Research Article
  • Citations2

New Collective Signatures Based on the Elliptic Curve Discrete Logarithm Problem

  • Jan 01, 2022
  • Computers, Materials & Continua
  • Tuan Nguyen Kim +2
  • Book Chapter

Generation of Pseudo-random Sequences of the Maximum Period Using Elliptic Curves Transformations

  • Jan 01, 2022
  • Alexandr Kuznetsov +4
  • PDF
  • Research Article
  • Citations9

New SAT-based Model for Quantum Circuit Decision Problem: Searching for Low-Cost Quantum Implementation

  • Apr 09, 2024
  • IACR Communications in Cryptology
  • Jingwen Chen +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.