The DOI matches its Crossref record; 39 of the 41 references it cites were found in a registry or an index, and 1 are not checked yet.
Status report on the second round of the NIST post-quantum cryptography standardization process
Open accessAbstract
The Information Technology Laboratory (ITL) at the National Institute of Standards and Technology (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the Nation's measurement and standards infrastructure.ITL develops tests, test methods, reference data, proof of concept implementations, and technical analyses to advance the development and productive use of information technology.ITL's responsibilities include the development of management, administrative, technical, and physical standards and guidelines for the cost-effective security and privacy of other than national security-related information in federal information systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 cited source says what the claim attributes to it.
In the citing paper
“Classic McEliece was a third-round fi nalist, and the other three algorithms were alternates [13].”
From Status report on the fourth round of the NIST post-quantum cryptography standardization process (2025) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Classic McEliece was a third-round fi nalist, and the other three algorithms were alternates [13].”
From Status report on the fourth round of the NIST post-quantum cryptography standardization process (2025) · cites this paper as [13]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
Report on Post-Quantum Cryptography
Chen, L., Jordan, S., Liu, Y.-K., Moody, D., Peralta, R., Perlner, R., & Smith-Tone, D. (2016) · doi:10.6028/nist.ir.8105 · Cited by 1,034
Self-citationFiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10366-7_35 · Cited by 601
A Modular Analysis of the Fujisaki-Okamoto Transformation
Hofheinz, D., Hövelmanns, K., & Kiltz, E. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70500-2_12 · Cited by 502
Zero-knowledge from secure multiparty computation
Ishai, Y., Eyal Kushilevitz, Z., Ostrovsky, R., & Sahai, A. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250794 · Cited by 425
Status report on the first round of the NIST post-quantum cryptography standardization process
Alagic, G., Alperin-Sheriff, J., Apon, D., Cooper, D., Dang, Q., Liu, Y.-K., Miller, C., Moody, D., Peralta, R., Perlner, R., et al. (2019) · doi:10.6028/nist.ir.8240 · Cited by 364
Self-citationAlbrecht, M. R., Rechberger, C., Schneider, T. H., Tiessen, T., & Zohner, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46800-5_17 · Cited by 296
New lattice-based cryptographic constructions
Regev, O. (2004) · Journal of the ACM · doi:10.1145/1039488.1039490 · Cited by 295
Digital signature standard (DSS)
National Institute of Standards and Technology (US) (2013) · doi:10.6028/nist.fips.186-4 · Cited by 246
Pseudorandomness of ring-LWE for any ring and modulus
Peikert, C., Regev, O., & Stephens-Davidowitz, N. (2017) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055489 · Cited by 178
LWE with Side Information: Attacks and Concrete Security Estimation
Dachman-Soled, D., Ducas, L., Gong, H., & Rossi, M. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_12 · Cited by 162
Recommendation for pair-wise key-establishment schemes using discrete logarithm cryptography
Barker, E., Chen, L., Roginsky, A., Vassilev, A., & Davis, R. (2018) · doi:10.6028/nist.sp.800-56ar3 · Cited by 158
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model
Don, J., Fehr, S., Majenz, C., & Schaffner, C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26951-7_13 · Cited by 147
Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems
Bardet, M., Bros, M., Cabarcas, D., Gaborit, P., Perlner, R. A., Smith-Tone, D., Tillich, J., & Verbel, J. A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64837-4_17 · Cited by 139
Self-citationGuo, Q., Johansson, T., & Nilsson, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_13 · Cited by 89
On the Cost of Computing Isogenies Between Supersingular Elliptic Curves
Adj, G., Cervantes-Vázquez, D., Chi-Domínguez, J.-J., Menezes, A., & Rodríguez‐Henríquez, F. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-10970-7_15 · Cited by 89
Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE
Jaques, S., & Schanck, J. M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26948-7_2 · Cited by 87
Recommendation for pair-wise key establishment using integer factorization cryptography
Barker, E., Chen, L., Roginsky, A., Vassilev, A., Davis, R., & Simon, S. (2019) · doi:10.6028/nist.sp.800-56br2 · Cited by 81
An Algebraic Attack on Rank Metric Code-Based Cryptosystems
Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., & Tillich, J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45727-3_3 · Cited by 75
Hülsing, A., Ning, K.-C., Schwabe, P., Weber, F. J., & Zimmermann, P. R. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00030 · Cited by 75
Timing Attacks on Error Correcting Codes in Post-Quantum Schemes
D’Anvers, J.-P., Tiepelt, M., Vercauteren, F., & Verbauwhede, I. M. R. (2019) · doi:10.1145/3338467.3358948 · Cited by 65
Haraka v2 – Efficient Short-Input Hashing for Post-Quantum Applications
Kölbl, S., Lauridsen, M. M., Mendel, F., & Rechberger, C. (2017) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2016.i2.1-29 · Cited by 65
QC-MDPC Decoders with Several Shades of Gray
Drucker, N., Gueron, S., & Kostić, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-44223-1_3 · Cited by 60
Number “Not Used” Once - Practical Fault Attack on pqm4 Implementations of NIST Candidates
Ravi, P., Roy, D. B., Bhasin, S., Chattopadhyay, A., & Mukhopadhyay, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-16350-1_13 · Cited by 47
Algebraically Structured LWE, Revisited
Peikert, C., & Pepin, Z. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-36030-6_1 · Cited by 46
Grafting Trees: A Fault Attack Against the SPHINCS Framework
Castelnovi, L., Martinelli, A., & Prest, T. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_8 · Cited by 46
Haraka v2 – Efficient Short-Input Hashing for Post-Quantum Applications
Kölbl, S., Lauridsen, M. M., Mendel, F., et al. (2017) · DOAJ (DOAJ: Directory of Open Access Journals) · doi:10.13154/tosc.v2016.i2.1-29 · Cited by 42
BBQ: Using AES in Picnic Signatures
Guilhem, C. D. D. S., Meyer, L. D., Orsini, E., & Smart, N. P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-38471-5_27 · Cited by 40
About Low DFR for QC-MDPC Decoding
Sendrier, N., & Vasseur, V. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-44223-1_2 · Cited by 33
A Novel CCA Attack Using Decryption Errors Against LAC
Guo, Q., Johansson, T., & Yang, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34578-5_4 · Cited by 32
Attack on LAC Key Exchange in Misuse Situation
Greuet, A., Montoya, S., & Renault, G. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-65411-5_27 · Cited by 28
Practical Fault Injection Attacks on SPHINCS.Preprint
Genêt, A., Kannwischer, M. J., Pelletier, H., & McLauchlan, A. (2018) · IACR Cryptology ePrint Archive · Cited by 22
Apon, D., Perlner, R. A., Robinson, A., & Santini, P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56877-1_14 · Cited by 19
Self-citationDifferential Power Analysis of the Picnic Signature Scheme
Gellersen, T., Seker, O., & Eisenbarth, T. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81293-5_10 · Cited by 18
Cryptanalysis of the Lifted Unbalanced Oil Vinegar Signature Scheme
Ding, J., Deaton, J., Schmidt, K., vishakha, V., & Zhang, Z. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56877-1_10 · Cited by 15
Rainbow Band Separation is Better than we ThoughtPreprint
Perlner, R. A., & Smith-Tone, D. (2020) · IACR Cryptology ePrint Archive · Cited by 13
Self-citationRevisiting the Hybrid attack on sparse and ternary secret LWE.Preprint
Son, Y., & Cheon, J. H. (2019) · IACR Cryptology ePrint Archive · Cited by 12
Choosing subfields for LUOV and lifting fields for rainbow
Duong, D. H., Luyen, L. V., & Tran, H. T. N. (2019) · IET Information Security · doi:10.1049/iet-ifs.2018.5288 · Cited by 7
A Note on Parameter Choices of Round5.Preprint
Son, Y. (2019) · IACR Cryptology ePrint Archive · Cited by 3
Research works printed but not linked: 7
- Moody D (2016) Post-Quantum Cryptography Standardization: Announcement and outline of NIST's Call for Submissions. International Conference on Post-Quantum Cryptography -PQCrypto. Available at https://csrc.nist.gov/Presentations/2016/Announcement-and-outline-of- NIST-s-Call-for-Submis
- Workshop on Cybersecurity in a Post-Quantum World. National Institute of Standards and Technology, Gaithersburg, Maryland, April 2-3, 2015. Available at https://csrc.nist.gov/Events/2015/Workshop-on-Cybersecurity- in-a-Post-Quantum-World.
- Bernstein D, Lange T (eds.), eBACS: ECRYPT Benchmarking of Cryptographic Systems -SUPERCOP (2020). Available at https://bench.cr.yp.to/supercop.html
- Eiichiro F, Okamoto T (1999) Secure Integration of Asymmetric and Symmetric Encryption Schemes. Annual International Cryptology Conference -CRYPTO (Springer), pp. 537-544. https://doi.org/10.5555/646764.706343 · DOI
- Erdem A, Ducas L, Pöppelmann T, Schwabe P (2016) Post-quantum key exchange-a new hope. USENIX Security Symposium (USENIX association), pp. 327-343. https://doi.org/10.5555/3241094.3241120 · DOI
- Lyubashevsky V, Peikert C, Regev O (2010) On Ideal Lattices and Learning with Errors over Rings. Annual International Conference on the Theory and Applications of Cryptographic Techniques -EUROCRYPT (Springer), pp. 1- 23. https://doi.org/10.1007/978-3-642-12190-5_1 · DOI
- Greuet A, Montoya S, Renault G (2020) Attack on LAC Key Exchange in Misuse Situation. Cryptology ePrint Archive preprint. https://eprint.iacr.org/2020/063
Cited by
Sorted by citations
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D. A., Dang, Q. H., Dang, T., Kelsey, J. M., Lichtinger, J., Liu, Y.-K., Miller, C. A., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 492
Self-citationA Survey on Edge and Edge-Cloud Computing Assisted Cyber-Physical Systems
Cao, K., Hu, S., Shi, Y., Colombo, A. W., Karnouskos, S., & Li, X. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3073066 · Cited by 307
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301
Self-citationCommercial applications of quantum computing
Bova, F., Avi Goldfarb, B., & Melko, R. G. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00091-1 · Cited by 263
A Compact Hardware Implementation of CCA-Secure Key Exchange Mechanism CRYSTALS-KYBER on FPGA
Xing, Y., & Li, S. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i2.328-356 · Cited by 226
Metadata
- Authors
- Moody, D., Alagic, G., Apon, D. C., Cooper, D. A., Dang, Q. H., Kelsey, J. M., Liu, Y.-K., Miller, C. A., Peralta, R. C., Perlner, R. A., Robinson, A. Y., Smith-Tone, D. C., & Alperin-Sheriff, J.
- Affiliations
- National Institute of Standards and Technology (US)
- ORCID
- Published
- 2020-07
- OpenAlex
- W4254706618
- Cited by
- 296
- References
- 41
- Citations by year
- 2026: 12 · 2025: 27 · 2024: 28 · 2023: 77 · 2022: 84 · 2021: 60 · 2020: 8
- Type
- report
- Language
- en
- Open access
- gold
- doi.org
- Funders
- Information Technology Laboratory
- 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, cryptographic standardization, quantum-resistant algorithms, public-key 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
