CoChat

Quantum algorithms for computing general discrete logarithms and orders with tradeoffs

Open access
Ekerå, Martin · 2021 · Journal of Mathematical Cryptology

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1515/jmc-2020-0006

Cites

24 of 24 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 24 references

Research works printed but not linked: 1

  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

See all 5

Metadata

Authors
Ekerå, M.
Affiliations
Swedish Armed Forces (SE)
Corresponding author
Ekerå, Martin
Venue
Journal of Mathematical Cryptology
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
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.