Extending Regev's factoring algorithm to compute discrete logarithms
From MaRDI portal
Cites work
- 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?)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On completely factoring any integer efficiently in a single run of an order-finding algorithm
- 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 general discrete logarithms and orders with tradeoffs
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Riemann's hypothesis and tests for primality
- Space-efficient and noise-robust quantum factoring
- The expected number of random elements to generate a finite Abelian group
Cited in
(7)- Space-efficient and noise-robust quantum factoring
- An efficient quantum factoring algorithm
- Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms
- Extending Regev's quantum algorithm to elliptic curves
- Reducing the number of qubits in quantum factoring
- A new approach to generic lower bounds. Classical/quantum MDL, quantum factoring, and more
- Parallel spooky pebbling makes Regev factoring more practical
This page was built for publication: Extending Regev's factoring algorithm to compute discrete logarithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030927)
