Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.

On post-processing in the quantum algorithm for computing short discrete logarithms

Open access
Ekerå, Martin · 2020 · Designs, Codes and Cryptography

Abstract

We revisit the quantum algorithm for computing short discrete logarithms that was recently introduced by Ekerå and Håstad. By carefully analyzing the probability distribution induced by the algorithm, we show its success probability to be higher than previously reported. Inspired by our improved understanding of the distribution, we propose an improved post-processing algorithm that is considerably more efficient, enables better tradeoffs to be achieved, and requires fewer runs, than the original post-processing algorithm. To prove these claims, we construct a classical simulator for the quantum algorithm by sampling the probability distribution it induces for given logarithms. This simulator is in itself a key contribution. We use it to demonstrate that Ekerå–Håstad achieves an advantage over Shor, not only in each individual run, but also overall, when targeting cryptographically relevant instances of RSA and Diffie–Hellman with short exponents.

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.1007/s10623-020-00783-2

Cites

17 of 17 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 The interval length # b ( e ) = b 1 ( e ) -b 0 ( e ) for m = 4, ℓ = 2 and d = 13. Similar staircase-like plots arise irrespective of how the parameters are selected
Fig. 1 The interval length # b ( e ) = b 1 ( e ) -b 0 ( e ) for m = 4, ℓ = 2 and d = 13. Similar staircase-like plots arise irrespective of how the parameters are selectedCC-BY · From the PDF
Image 2
CC-BY · From the PDF

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?

4 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

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 17 references

Research works printed but not linked: 1

  1. Shor P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: SFCS. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134. IEEE Computer Society, Washington DC (1994).

Cited by

See all 23

Metadata

Authors
Ekerå, M.
Affiliations
Swedish Armed Forces (SE)
Corresponding author
Ekerå, Martin
Venue
Designs, Codes and Cryptography
Published
2020-08-06
Volume
88
Issue
11
Pages
2313-2335
ISSN
  • 0925-1022 (ISSN-L)
  • 1573-7586
OpenAlex
W2795035933
Cited by
23
References
17
Citations by year
2026: 2 · 2025: 6 · 2024: 3 · 2023: 2 · 2022: 3 · 2021: 4 · 2020: 2
FWCI
1.08
Type
journal article
Language
en
Open access
Licence
Locations
  • Designs Codes and Cryptography (publishedVersion, cc-by)
  • IACR Cryptology ePrint Archive (submittedVersion)
Funders
Swedish NCSA, Swedish Armed Forces (Not applicable)
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, post-processing, success probability, Shor's algorithm, Diffie-Hellman, cryptanalysis

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: On post-processing in the quantum algorithm for computing short discrete logarithms. https://app.cochat.ai/papers/10.1007/s10623-020-00783-2
The paper
Ekerå, M. (2020). On post-processing in the quantum algorithm for computing short discrete logarithms. Designs, Codes and Cryptography. https://doi.org/10.1007/s10623-020-00783-2

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.