CoChat
Sign Up
Cited by 299Quantum Computing Algorithms and ArchitectureCryptographic Implementations and SecurityQuantum Information and Cryptography

Applying Grover’s Algorithm to AES: Quantum Resource Estimates

Grassl, Markus, Langenberg, Brandon, Roetteler, Martin, Steinwandt, Rainer·2016·Lecture Notes in Computer Science
DOI 10.1007/978-3-319-29360-8_3
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-319-29360-8_3

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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 cost of dealing with random statistics is not expensive compared with the previous work [6] under the single processor assumption.

    “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]

  • Grassl et al. ensured a single target key in AES key search by encrypting r∈{3,4,5} plaintext blocks simultaneously to obtain r ciphertexts so that only the true key results in given ciphertexts; this removes ambiguity in the number of iterations at the cost of at least tripling the space cost.

    “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]

  • Compared with [6], the circuit is about three times longer but requires one-third of the qubits.

    “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]

Cites

Flagged first, then by citations

2 of the 32 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Related

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
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer International Publishing
Published
2016
Pages
29-43
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-319-29360-8_3
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
Licence
www.springer.com/tdm (unspecified)
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 › Computer Science › Artificial Intelligence › 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