Post-Quantum Cryptography
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
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
“However, even without standardization, Google recently conducted some experiments with Lattice-based cryptosystems and demonstrated their appropriateness in large scale encryption cracking applications [188], [189].”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [188]
Citations
Cites
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 · cited 2×
“See also [3,4] for techniques how to optimize the T -count and [2] for techniques that allow to navigate the trade-space between T -depth and the number of qubits used.”
Applying Grover’s Algorithm to AES: Quantum Resource Estimates
Grassl, M., Langenberg, B., Roetteler, M., & Steinwandt, R. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-29360-8_3 · Cited by 299
Analysis of Information Set Decoding for a Sub-linear Error Weight
Canto Torres, R., & Sendrier, N. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-29360-8_10 · Cited by 85
Post-Quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation
Anand, M. V., Ebrahimi, E., Tabia, G. N. M., & Unruh, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29360-8_4 · Cited by 78
Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes
Bardet, M., Chaulet, J., Drăgoi, V., Otmani, A., & Tillich, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29360-8_9 · Cited by 71
Extension Field Cancellation: A New Central Trapdoor for Multivariate Quadratic Systems
Szepieniec, A., Ding, J., & Bart Preneel, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29360-8_12 · Cited by 35
An Efficient Attack on a Code-Based Signature Scheme
Phesso, A., & Tillich, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29360-8_7 · Cited by 27
IND-CCA Secure Hybrid Encryption from QC-MDPC Niederreiter
von Maurich, I., Heberle, L., & Güneysu, T. E. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29360-8_1 · Cited by 25
Security Analysis and Key Modification for ZHFE
Perlner, R. A., & Smith-Tone, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29360-8_13 · Cited by 20
Vulnerabilities of “McEliece in the World of Escher”
Moody, D., & Perlner, R. A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29360-8_8 · Cited by 19
Cited by
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Zero Trust Architecture (ZTA): A Comprehensive Survey
Syed, N. F., Shah, S. W., Shaghaghi, A., Anwar, A., Baig, Z., & Doss, R. (2022) · IEEE Access · doi:10.1109/access.2022.3174679 · Cited by 406
Code-based Pseudorandom Generator for the Post-Quantum Period
Kuznetsov, A. A., Кіян, А., Gorbenko, Y., Smirnov, O. A., Череп, О., & Bekhter, L. (2019) · IEEE International Conference on Advanced Trends in Information Theory (ATIT) · doi:10.1109/atit49449.2019.9030493 · Cited by 57
Hanna, Y., Bozhko, J., Tonyalı, S., Harrilal-Parchment, R., Cebe, M., & Akkaya, K. (2025) · Internet of Things · doi:10.1016/j.iot.2025.101650 · Cited by 55
Quantum Key-Recovery on Full AEZ
Bonnetain, X. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_20 · Cited by 43
Metadata
- Authors
- Takagi, T.
- Affiliations
- Kyushu University (JP)
- Corresponding author
- Tsuyoshi Takagi
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2016
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2890203463
- Semantic Scholar
- ee5ddb275c8d07df69dbfeb231f64e088ca0daee
- 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.