The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers
Open accessAbstract
We generalize the quantum algorithm for computing short discrete logarithms previously introduced by Ekera [2] so as to allow for various tradeoffs between the number of times that the algorithm need be executed on the one hand, and the complexity of the algorithm and the requirements it imposes on the quantum computer on the other hand. Furthermore, we describe applications of algorithms for computing short discrete logarithms. In particular, we show how other important problems such as those of factoring RSA integers and of finding the order of groups under side information may be recast as short discrete logarithm problems. This gives rise to an algorithm for factoring RSA integers that is less complex than Shor’s general factoring algorithm in the sense that it imposes smaller requirements on the quantum computer. In both our algorithm and Shor’s algorithm, the main hurdle is to compute a modular exponentiation in superposition. When factoring an n bit integer, the exponent is of length 2n bits in Shor’s algorithm, compared to slightly more than n/2 bits in our algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“In a groundbreaking paper [5] from 1994, subsequently extended and revised in a later publication [6], Shor introduced polynomial time quantum computer algorithms for factoring integers over Z and for computing discrete logarithms in the multiplicative group F ∗ p of the finite field F p .”
BackgroundPolynomial-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
Fast parallel circuits for the quantum Fourier transform
Cleve, R., & Watrous, J. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892140 · Cited by 215
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
Mosca, M., & EKERT, A. K. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_15 · Cited by 179 · cited 1×
“For example, Mosca and Ekert [4] have described optimizations of Shor’s general algorithm for computing discrete logarithm that allow the index registers to be truncated.”
MethodThe discrete logarithm modulo a composite hides 0(n) Bits
Håstad, J., Schrift, A. W., & Adi Shamir, Z. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90038-x · Cited by 85 · cited 1×
“In this section we describe how the RSA integer factoring problem may be recast as a short discrete logarithm problem by using ideas from H˚astad et al. [3], and the fact that our algorithm does not require the group order to be known.”
MethodSelf-citationFast Lattice Point Enumeration with Minimal Overhead
Micciancio, D., & Walter, M. (2014) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973730.21 · Cited by 62
Fast Lattice Point Enumeration with Minimal Overhead
Micciancio, D., & Walter, M. (2014) · Cited by 43
Using Fewer Qubits in Shor’s Factorization Algorithm via Simultaneous Diophantine Approximation
Seifert, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45353-9_24 · Cited by 28
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
“[23] M.”
BackgroundMethodResultInfluentialSelf-citationQuantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_9 · Cited by 212
Review of Distributed Quantum Computing: From single QPU to High Performance Quantum Computing
Barral, D., Cardama, F. J., Díaz-Camacho, G., Faílde, D., Llovo, I. F., Juane, M. M., Vázquez-Pérez, J., Villasuso, J., Piñeiro, C., Costas, N., et al. (2025) · Computer Science Review · doi:10.1016/j.cosrev.2025.100747 · Cited by 243
“More recently, Gidney et al. [325] analyze the hardware resources for factoring large numbers, using the Ekerå and Hås-tad algorithm [326] instead of the Shor one.”
Fathalla, E., & Azab, M. (2024) · IEEE Access · doi:10.1109/access.2024.3485602 · Cited by 83
Yunakovsky, S. E., Kot, M., Pozhar, N. O., Nabokov, D., Kudinov, M., Guglya, A. P., Kiktenko, E. O., Kolycheva, E., Borisov, A., & Fedorov, A. K. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00104-z · Cited by 48
Metadata
- Authors
- Ekerå, M., & Håstad, J.
- Affiliations
- Swedish Armed Forces (SE)
- KTH Royal Institute of Technology (SE)
- Corresponding author
- Ekerå, Martin
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2017
- Pages
- 347-363
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2594615149
- Cited by
- 62
- References
- 9
- Citations by year
- 2026: 7 · 2025: 16 · 2024: 10 · 2023: 5 · 2022: 8 · 2021: 8 · 2020: 4 · 2019: 2 · 2017: 2
- FWCI
- 1.00
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Lecture notes in computer science (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- 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, Shor's algorithm, side information
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 Short Discrete Logarithms and Factoring RSA Integers. https://app.cochat.ai/papers/10.1007/978-3-319-59879-6_20
- The paper
- Ekerå, M., & Håstad, J. (2017). Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-59879-6_20
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.