Reducing the Number of Qubits in Quantum Discrete Logarithms on Elliptic Curves
Authors:
- Clémence ChevignardCCClémence Chevignard
- Pierre-Alain FouquePFPierre-Alain Fouque
- André SchrottenloherASAndré Schrottenloher
- 8 May 2026
- book chapter
- Published by Springer Nature
- p. 371-401
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Reducing the Number of Qubits in Quantum Factoring2025
- Periodic autocorrelation of sequencesCryptography and Communications, 2023
- Performance Analysis of a Repetition Cat Code Architecture: Computing 256-bit Elliptic Curve Logarithm in 9 Hours with 126 133 Cat QubitsPhysical Review Letters, 2023
- On post-processing in the quantum algorithm for computing short discrete logarithmsDesigns, Codes and Cryptography, 2020
- Improved Quantum Circuits for Elliptic Curve Discrete Logarithms2020
- Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers2017
- Complete Addition Formulas for Prime Order Elliptic Curves2016
- An Efficient Exact Quantum Algorithm for the Integer Square-free Decomposition ProblemScientific Reports, 2012
- On the Bits of Elliptic Curve Diffie-Hellman KeysLecture Notes in Computer Science, 2007
- Modular exponentiation via the explicit Chinese remainder theoremMathematics of Computation, 2006