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

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

Grassl, Markus, Langenberg, Brandon, Roetteler, Martin, Steinwandt, Rainer·2016·Lecture Notes in Computer Science

Overview

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.

Verification

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?

Citations

Cites

Show all 32 references

Research works printed but not linked: 3

  1. 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
  2. Konheim, A.G.: Crypt. A Primer. Wiley, Hoboken (1981)
  3. 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

Items 101–200 of 299

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