Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
We generalize our earlier works on computing short discrete logarithms with tradeoffs, and bridge them with Seifert's work on computing orders with tradeoffs, and with Shor's groundbreaking works on computing orders and general discrete logarithms. In particular, we enable tradeoffs when computing general discrete logarithms. Compared to Shor's algorithm, this yields a reduction by up to a factor of two in the number of group operations evaluated quantumly in each run, at the expense of having to perform multiple runs. Unlike Shor's algorithm, our algorithm does not require the group order to be known. It simultaneously computes both the order and the logarithm. We analyze the probability distributions induced by our algorithm, and by Shor's and Seifert's order-finding algorithms, describe how these algorithms may be simulated when the solution is known, and estimate the number of runs required for a given minimum success probability when making different tradeoffs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“It is also reduced by using Eker˚ a and H˚ astad's derivatives [21, 23-25] of Shor's algorithms, that require fewer multiplications to be performed compared to Shor's original algorithms.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [24]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These algorithms do not require the order of the group to be known.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [24]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“As is explained in [23, 24], a single correct run of these quantum algorithms suffices for the logarithm to be recovered with ≥ 99% success probability in the classical post-processing.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [24]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“To compute general discrete logarithms in safe-prime or Schnorr groups, one option is to use Eker˚ a's algorithm [24].”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [24]
The cited source says what the claim attributes to it.
In the citing paper
“This is because Eker˚ a's algorithm does not require r to be known. In fact, it computes both d and r .”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [24]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,018 · cited 2×
“If it proves insufficient, we proceed to compute a BKZ reduction.”
MethodLattice basis reduction: Improved practical algorithms and solving subset sum problems
Schnorr, C. P., & Euchner, M. (1994) · Mathematical Programming · doi:10.1007/bf01581144 · Cited by 1,427
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
On Lovász’ lattice reduction and the nearest lattice point problem
Babai, L. (1986) · Combinatorica · doi:10.1007/bf02579403 · Cited by 938 · cited 3×
“Then, we map (α′d, α′r) to the closest admissible argument pair (αd, αr) ∈ Lα by reducing the basis for Lα given in Definition 4.3 and applying Babai’s algorithm [1].”
MethodInfluentialRiemann's hypothesis and tests for primality
Miller, G. L. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80043-8 · Cited by 709
A hierarchy of polynomial time lattice basis reduction algorithms
Schnorr, C. P. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90064-8 · Cited by 648 · cited 2×
“If it proves insufficient, we proceed to compute a BKZ reduction.”
MethodImproved algorithms for integer programming and related lattice problems
Kannan, R. (1983) · Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 · doi:10.1145/800061.808749 · Cited by 441 · cited 1×
“Enumeration is performed using Kannan’s [10] original approach, as this is sufficient for our purposes.”
Method
Research works printed but not linked: 1
- P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, SFCS ’94 (1994), 124–134 · DOI · Paper page
Cited by
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
“Computing discrete logarithms using Eker̊a-H̊astad’s [23, 24] and Eker̊a’s [25] algorithms.”
MethodInfluentialSelf-citationOn completely factoring any integer efficiently in a single run of an order-finding algorithm
Ekerå, M. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03069-1 · Cited by 23
“Appendix A to [4] or [2].”
Self-citationThe Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers
Aono, Y., Liu, S., Tanaka, T., Uno, S., Meter, R. V., Shinohara, N., & Nojima, R. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3183385 · Cited by 15
“If the quantum circuit works without any quantum noise, we know the observed points are close to lattice points with a high probability [24], [28].”
BackgroundMethodHow to factor 2048 bit RSA integers with less than a million noisy qubits
Gidney, C. (2025) · arXiv · Cited by 7
Three-Body Logging for Data Management
Universal Life Church, H. 6. 3. S., & Pachankis, Y. I. (2023) · Journal of Theoretical Physics & Mathematics Research · doi:10.64030/3065-8802.01.01.01
Metadata
- Authors
- Ekerå, M.
- Affiliations
- Swedish Armed Forces (SE)
- Corresponding author
- Ekerå, Martin
- ORCID
- Ekerå, Martin
- Venue
- Journal of Mathematical Cryptology
- Publisher
- Walter de Gruyter GmbH
- Published
- 2021-01-01
- Volume
- 15
- Issue
- 1
- Pages
- 359-407
- ISSN
- 1862-2976 (ISSN-L)
- 1862-2984
- OpenAlex
- W2894255691
- Cited by
- 3
- References
- 22
- Citations by year
- 2023: 1 · 2022: 1 · 2021: 1
- FWCI
- 0.26
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Journal of Mathematical Cryptology (publishedVersion, cc-by)
- IACR Cryptology ePrint Archive (submittedVersion)
- Funders
- National Centre for Supercomputing Applications
- Försvarsmakten
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- quantum algorithms, discrete logarithm problem, Shor's algorithm, success probability, algorithm simulation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum algorithms for computing general discrete logarithms and orders with tradeoffs. https://app.cochat.ai/papers/10.1515/jmc-2020-0006
- The paper
- Ekerå, M. (2021). Quantum algorithms for computing general discrete logarithms and orders with tradeoffs. Journal of Mathematical Cryptology. https://doi.org/10.1515/jmc-2020-0006
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.