The DOI matches its Crossref record; 30 of the 32 references it cites were found in a registry or an index.
Applying Grover’s Algorithm to AES: Quantum Resource Estimates
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Surprisingly, however, the cost of dealing with random statistics in this paper is not expensive compared with the previous work [6] under the single processor assumption.”
From Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (2018) · cites this paper as [6]
In the citing paper
“To avoid the cases, the authors encrypt r (∈ {3, 4, 5}) plaintext blocks simultaneously to obtain r ciphertexts so that only the true key results in given ciphertexts.The procedure removes the ambiguity in the number of iterations.Note, however, that the removal of the ambiguity comes in exchange of at least tripling the space cost.”
From Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (2018) · cites this paper as [6]
In the citing paper
“Compared with[6], the circuit is about three times longer but requires one-third of qubits.”
From Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (2018) · cites this paper as [6]
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,450
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
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
The Magma Algebra System I: The User Language
Bosma, W., Cannon, J., & Playoust, C. (1997) · Journal of Symbolic Computation · doi:10.1006/jsco.1996.0125 · Cited by 7,378
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
(1996) · Cited by 824
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2013.2244643 · Cited by 549
Self-citationQuantum Amplitude Amplification and Estimation
Gilles Brassard, A., Høyer, P., Mosca, M., & Tapp, A. (2000) · doi:10.48550/arxiv.quant-ph/0005055 · Cited by 514
High-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486
Brassard, G., Høyer, P., & Tapp, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055105 · Cited by 390
Overhead and noise threshold of fault-tolerant quantum error correction
Steane, A. M. (2003) · Physical Review A · doi:10.1103/physreva.68.042322 · Cited by 372
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
Amy, M., Maslov, D. A., & Mosca, M. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2341953 · Cited by 319
Fixed-Point Quantum Search with an Optimal Number of Queries
Yoder, T. J., Low, G. H., & Chuang, I. L. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.210501 · Cited by 267
Low-overhead constructions for the fault-tolerant Toffoli gate
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.022328 · Cited by 200
Maslov, D. (2016) · Physical Review A · doi:10.1103/physreva.93.022311 · Cited by 193
Quantum differential and linear cryptanalysis
Leurent, G., Kaplan, M. A., Leverrier, A., & Naya‐Plasencia, M. (2017) · HAL · Cited by 133
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
Cheung, D., Maslov, D., Mathew, J., & Pradhan, D. K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89304-2_9 · Cited by 68
Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits
Wiebe, N., & Roetteler, M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.1-2-9 · Cited by 61
Self-citationA note on quantum related-key attacks
Roetteler, M., & Steinwandt, R. (2014) · Information Processing Letters · doi:10.1016/j.ipl.2014.08.009 · Cited by 59
Self-citationMaslov, D., Falconer, S. M., & Mosca, M. (2007) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1145/1278480.1278717 · Cited by 37
Quantum circuits for $${\mathbb {F}}_{2^{n}}$$ F 2 n -multiplication with subquadratic gate count
Kepley, S., & Steinwandt, R. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0993-1 · Cited by 32
Self-citationQuantum universality by state distillationPreprint
Reichardt, B. W. (2009) · doi:10.5555/2012098.2012105 · Cited by 30
Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity
Amento, B., Rötteler, M., & Steinwandt, R. (2012) · Quantum information & computation · doi:10.26421/qic13.7-8-5 · Cited by 26
Strict key avalanche criterion.
Dawson, E., Gustafson, H., & Pettitt, A. N. (1992) · Cited by 17
Solving puzzles related to permutation groups
Egner, S., & Püschel, M. (1998) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/281508.281611 · Cited by 10
Maslov, D., Falconer, S. M., & Mosca, M. (2007) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.2007.375304 · Cited by 6
Research works printed but not linked: 3
- Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits (2013). arXiv:quant-ph/1206.0758v3 , arxiv.org/abs/1206.0758v3 · arXiv
- Konheim, A.G.: Crypt. A Primer. Wiley, Hoboken (1981)
- Maslov, D.: On the advantages of using relative phase Toffolis with an application tomultiple control Toffoli optimization. arXiv:1508.03273 · arXiv
Cited by
Sorted by citations
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Implementing Grover Oracles for Quantum Key Search on AES and LowMC
Jaques, S., Naehrig, M., Roetteler, M., & Virdia, F. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-45724-2_10 · Cited by 234
Self-citationQuantum Security Analysis of AES
Bonnetain, X., Naya‐Plasencia, M., & Schrottenloher, A. (2019) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2019.i2.55-93 · Cited by 191
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3
Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., & Schanck, J. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-69453-5_18 · Cited by 128
Reducing the Cost of Implementing AES as a Quantum Circuit
Langenberg, B., Pham, H., & Steinwandt, R. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.2965697 · Cited by 85
Self-citation
Metadata
- Authors
- Grassl, M., Langenberg, B., Roetteler, M., & Steinwandt, R.
- Affiliations
- Friedrich-Alexander-Universität Erlangen-Nürnberg (DE)
- Florida Atlantic University (US)
- Microsoft (United States) (US)
- Corresponding author
- Roetteler, Martin
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2016
- Pages
- 29-43
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2212436842
- Cited by
- 299
- References
- 32
- Citations by year
- 2026: 34 · 2025: 52 · 2024: 55 · 2023: 36 · 2022: 36 · 2021: 29 · 2020: 23 · 2019: 14 · 2018: 9 · 2017: 9 · 2016: 2
- FWCI
- 6.11
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- Grover's algorithm, AES, brute force attacks, quantum resource estimation, Clifford+T gates, fault-tolerant quantum computing, circuit depth, qubit count, key recovery, 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
