CoChat

Post-Quantum Cryptography

Tsuyoshi Takagi · 2016 · Lecture Notes in Computer Science

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

Abstract

We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard AES and analyze the quantum resources required to carry out such an attack. We consider the overall circuit size, the number of qubits, and the circuit depth as measures for the cost of the presented quantum algorithms. Throughout, we focus on Clifford$$+T$$ gates as the underlying fault-tolerant logical quantum gate set. In particular, for all three variants of AES key size 128, 192, and 256i¾źbit that are standardized in FIPS-PUB 197, we establish precise bounds for the number of qubits and the number of elementary logical quantum gates that are needed to implement Grover's quantum algorithm to extract the key from a small number of AES plaintext-ciphertext pairs.

Overview

Integrity signals

Registry

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

Cites

14 of 14 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 14 references

Cited by

See all 29

Metadata

Authors
Takagi, T.
Affiliations
Kyushu University (JP)
Corresponding author
Tsuyoshi Takagi
Venue
Lecture Notes in Computer Science
Published
2016
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W2890203463
Cited by
25
References
13
Citations by year
2025: 1 · 2024: 4 · 2023: 5 · 2022: 4 · 2021: 1 · 2020: 1 · 2019: 2 · 2018: 2 · 2017: 5
FWCI
1.62
Type
conference paper
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
  • Lecture notes in computer science (publishedVersion)
  • DIAL (Catholic University of Leuven) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
Keywords
post-quantum cryptography, quantum computing threats, lattice-based cryptography, hash-based signatures, code-based cryptography, multivariate public-key cryptography, isogeny-based cryptography, digital signatures, key exchange

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: Post-Quantum Cryptography. https://app.cochat.ai/papers/10.1007/978-3-319-29360-8
The paper
Takagi, T. (2016). Post-Quantum Cryptography. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-29360-8

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.