Improved Quantum Circuits for Elliptic Curve Discrete Logarithms

DOI10.1007/978-3-030-44223-1_23OpenAlexW3022840541MaRDI 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

zbMATH Keywords

discrete logarithm problemelliptic curve cryptographyquantum cryptanalysisShor's algorithmresource estimates

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (7)

Quantum data visualization: a quantum computing framework for enhancing visual analysis of data ⋮ 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

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

This page was built for publication: Improved Quantum Circuits for Elliptic Curve Discrete Logarithms