Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
The author generalizes earlier works about a modified version of Shor's algorithm for computing short discrete logarithms with tradeoffs [\textit{M. Ekerå} and \textit{J. Håstad}, Lect. Notes Comput. Sci. 10346, 347--363 (2017; Zbl 1437.94058)]. The modified algorithm does not need the order of the group to be known because it computes both the order and the logarithm. However, it requires the logarithm to be small in comparison with the group order (`short discrete logarithm'). The paper also includes discussion of results of partial classical simulations of the suggested quantum algorithm.
- Quantum computation of discrete logarithms in semigroups
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- scientific article; zbMATH DE number 799789
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On post-processing in the quantum algorithm for computing short discrete logarithms
- Quantum algorithm for discrete logarithm problem for matrices over finite group rings
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
- scientific article; zbMATH DE number 5320241
- A hierarchy of polynomial time lattice basis reduction algorithms
- 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.)
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 1617936 (Why is no real title available?)
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- New directions in cryptography
- On Lovász' lattice reduction and the nearest lattice point problem
- On post-processing in the quantum algorithm for computing short discrete logarithms
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Riemann's hypothesis and tests for primality
- The discrete logarithm modulo a composite hides \(O(n)\) bits
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- On post-processing in the quantum algorithm for computing short discrete logarithms
- On completely factoring any integer efficiently in a single run of an order-finding algorithm
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- Quantum computation of discrete logarithms in semigroups
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
- Quantum complexity for discrete logarithms and related problems
- Reducing the number of qubits in quantum factoring
- Extending Regev's factoring algorithm to compute discrete logarithms
- Reducing the number of qubits in quantum discrete logarithms on elliptic curves
This page was built for publication: Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048182)
