Improved Quantum Circuits for Elliptic Curve Discrete Logarithms
From MaRDI portal
Publication:5041233
DOI10.1007/978-3-030-44223-1_23MaRDI QIDQ5041233
Martin Roetteler, Thomas Haener, Mathias Soeken, Samuel Jaques, Michael Naehrig
Publication date: 13 October 2022
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.09580
discrete logarithm problem; elliptic curve cryptography; quantum cryptanalysis; Shor's algorithm; resource estimates
Related Items
Concrete quantum cryptanalysis of binary elliptic curves via addition chain, Improved quantum analysis of SPECK and LowMC, Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields, A novel and efficient square root computation quantum circuit for floating-point standard, T-count optimized quantum circuit for floating point addition and multiplication, Parallel quantum addition for Korean block ciphers, Quantum data visualization: a quantum computing framework for enhancing visual analysis of data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Modular Multiplication Without Trial Division
- Time/Space Trade-Offs for Reversible Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The Montgomery inverse and its applications
- Logical Reversibility of Computation