Quantum algorithms for computing general discrete logarithms and orders with tradeoffs

DOI10.1515/JMC-2020-0006zbMath1485.68100OpenAlexW3161394282MaRDI QIDQ2048182

Martin Ekerå

Publication date: 5 August 2021

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2020-0006

zbMATH Keywords

quantum algorithmsdiscrete logarithmsShor's algorithmorder finding

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

On completely factoring any integer efficiently in a single run of an order-finding algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• On Lovász' lattice reduction and the nearest lattice point problem
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Riemann's hypothesis and tests for primality
• The discrete logarithm modulo a composite hides \(O(n)\) bits
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Quantum algorithms for computing short discrete logarithms and factoring RSA integers
• On post-processing in the quantum algorithm for computing short discrete logarithms
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

This page was built for publication: Quantum algorithms for computing general discrete logarithms and orders with tradeoffs