The DOI matches its Crossref record; 259 of the 259 references it cites were found in a registry or an index.
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Open accessAbstract
The National Institute of Standards and Technology is in the process of selecting public-key cryptographic algorithms through a public, competition-like process. The new public-key cryptography standards will specify additional digital signature, public-key encryption, and key-establishment algorithms to augment Federal Information Processing Standard (FIPS) 186-4, Digital Signature Standard (DSS), as well as NIST Special Publication (SP) 800-56A Revision 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B Revision 2, Recommendation for Pair-Wise Key Establishment Using Integer Factorization Cryptography. It is intended that these algorithms will be capable of protecting sensitive information well into the foreseeable future, including after the advent of quantum computers. The first round of the NIST Post-Quantum Cryptography Standardization Process began in December 2017 with 69 candidate algorithms that met both the minimum acceptance criteria and submission requirements. The first round lasted until January 2019, during which candidate algorithms were evaluated based on their security, performance, and other characteristics. NIST selected 26 algorithms to advance to the second round for more analysis. The second round continued until July 2020, after which seven 'finalist' and eight 'alternate' candidate algorithms were selected to move into the third round. This report describes the evaluation and selection process, based on public feedback and internal review, of the third-round candidates. The report summarizes each of the 15 third-round candidate algorithms and identifies those selected for standardization, as well as those that will continue to be evaluated in a fourth round of analysis. The public-key encryption and key-establishment algorithm that will be standardized is CRYSTALS-Kyber. The digital signatures that will be standardized are CRYSTALS-Dilithium, Falcon, and SPHINCS+. While there are multiple signature algorithms selected, NIST recommends CRYSTALS-Dilithium as the primary algorithm to be implemented. In addition, four of the alternate key-establishment candidate algorithms will advance to a fourth round of evaluation: BIKE, Classic McEliece, HQC, and SIKE. These candidates are still being considered for future standardization. NIST will also issue a new Call for Proposals for public-key digital signature algorithms to augment and diversify its signature portfolio.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Items 201–259 of 259
High-Speed FPGA Implementation of SIKE Based on an Ultra-Low-Latency Modular Multiplier
Tian, J., Wu, B., & Wang, Z. (2021) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2021.3094889 · Cited by 30
Lattice Reduction with Approximate Enumeration Oracles
Albrecht, M. R., Bai, S., Li, J., & Rowell, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84245-1_25 · Cited by 30
Systematic Study of Decryption and Re-encryption Leakage: The Case of Kyber
Azouaoui, M., Bronchain, O., Hoffmann, C., Kuzovkova, Y., Schneider, T., & Standaert, F. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-99766-3_11 · Cited by 30
On the Success Probability of Solving Unique SVP via BKZ
Postlethwaite, E. W., & Virdia, F. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75245-3_4 · Cited by 29
Cryptanalysis of LowMC instances using single plaintext/ciphertext pair
Banik, S., Barooti, K., Durak, F. B., & Serge Vaudenay, B. (2020) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2020.i4.130-146 · Cited by 29
Classic McEliece Implementation with Low Memory Footprint
Roth, J., Karatsiolis, E., & Krämer, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-68487-7_3 · Cited by 29
A Monolithic Hardware Implementation of Kyber: Comparing Apples to Apples in PQC Candidates
Bisheh-Niasar, M., Azarderakhsh, R., & Kermani, M. M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-88238-9_6 · Cited by 29
Algebraic Meet-in-the-Middle Attack on LowMC
Liu, F., Sarkar, S., Wang, G., Meier, W., & Isobe, T. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22963-3_8 · Cited by 29
Fast NEON-Based Multiplication for Lattice-Based NIST Post-quantum Cryptography Finalists
Nguyen, D. T., & Gaj, K. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81293-5_13 · Cited by 28
Racing BIKE: Improved Polynomial Multiplication and Inversion in Hardware
Richter-Brockmann, J., Chen, M.-S., Ghosh, S., & Güneysu, T. E. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i1.557-588 · Cited by 28
D’Anvers, J.-P., Beirendonck, M. V., & Verbauwhede, I. M. R. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2022.3197074 · Cited by 27
A Non Asymptotic Analysis of Information Set Decoding.
Hamdaoui, Y., & Sendrier, N. (2013) · Cited by 26
SoK: How (not) to Design and Implement Post-quantum Cryptography
Howe, J., Prest, T., & Apon, D. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75539-3_19 · Cited by 25
Self-citationBecker, A., Gama, N., & Joux, A. (2015) · IACR Cryptology ePrint Archive · Cited by 24
Lower Bounds on Lattice Enumeration with Extreme Pruning
Aono, Y., Nguyễn, P. Q., Seito, T., & Shikata, J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96881-0_21 · Cited by 24
High-order Table-based Conversion Algorithms and Masking Lattice-based Encryption
Coron, J.-S., Gérard, F., Montoya, S., & Zeitoun, R. (2022) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i2.1-40 · Cited by 23
Improving Support-Minors Rank Attacks: Applications to G$$\displaystyle e$$MSS and Rainbow
Baena, J. B., Briaud, P., Cabarcas, D., Perlner, R. A., Smith-Tone, D., & Verbel, J. A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15982-4_13 · Cited by 23
Self-citationImproved Cryptanalysis of HFEv- via Projection
Ding, J., Perlner, R. A., Petzoldt, A., & Smith-Tone, D. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_18 · Cited by 22
Self-citationFarahmand, F., Dang, V. B., Nguyen, D. T., & Gaj, K. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_2 · Cited by 22
A Complete Analysis of the BKZ Lattice Reduction Algorithm
Li, J., & Nguyễn, P. Q. (2024) · Journal of Cryptology · doi:10.1007/s00145-024-09527-0 · Cited by 22
New Attacks on LowMC Instances with a Single Plaintext/Ciphertext Pair
Banik, S., Barooti, K., Serge Vaudenay, B., & Yan, H. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3_11 · Cited by 22
Explicit bounds for generic decoding algorithms for code-based cryptography
Bernstein, D. D., Lange, T., Peters, C., & Tilborg, V. H. H. (2009) · TU/e Research Portal · Cited by 20
Decisional Second-Preimage Resistance: When Does SPR Imply PRE?
Bernstein, D. J., & Hülsing, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34618-8_2 · Cited by 20
Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP
Mukherjee, T., & Stephens-Davidowitz, N. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_8 · Cited by 20
On the applicability of the Fujisaki–Okamoto transformation to the BIKE KEM
Drucker, N., Gueron, S., Kostić, D., & Persichetti, E. (2021) · International Journal of Computer Mathematics Computer Systems Theory · doi:10.1080/23799927.2021.1930176 · Cited by 20
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices
Bernard, O., & Roux-Langlois, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_12 · Cited by 20
Lahr, N., Niederhagen, R., Petri, R., & Samardjiska, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64837-4_29 · Cited by 20
High-Performance FPGA Accelerator for SIKE
Khatib, R. E., Azarderakhsh, R., & Kermani, M. M. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3078691 · Cited by 20
Information-Set Decoding with Hints
Trautmann, A.-L., Puchinger, S., Renner, J., Schamberger, T., & Wachter-Zeh, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-98365-9_4 · Cited by 20
Optimized Polynomial Multiplier Over Commutative Rings on FPGAs: A Case Study on BIKE
Hu, J., Wang, W., Cheung, R. C. C., & Wang, H. (2019) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/icfpt47387.2019.00035 · Cited by 19
Differential 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
Ravi, P., Bhasin, S., Roy, S. S., & Chattopadhyay, A. (2020) · IACR Cryptology ePrint Archive · Cited by 16
One-Way Functions and Malleability Oracles: Hidden Shift Attacks on Isogeny-Based Protocols
Kutas, P., Merz, S.-P., Petit, C., & Weitkämper, C. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77870-5_9 · Cited by 16
A Compact Full Hardware Implementation of PQC Algorithm NTRU
Qin, Z., Tong, R., Wu, X., Bai, G., Wu, L., & Su, L. (2021) · International Conference on Communications, Information System and Computer Engineering (CISCE) · doi:10.1109/cisce52179.2021.9446042 · Cited by 16
Streamlined NTRU Prime on FPGA
Peng, B.-Y., Marotzke, A., Tsai, M., Yang, B., & Chen, H.-L. (2022) · Journal of Cryptographic Engineering · doi:10.1007/s13389-022-00303-z · Cited by 14
Rainbow Band Separation is Better than we ThoughtPreprint
Perlner, R. A., & Smith-Tone, D. (2020) · IACR Cryptology ePrint Archive · Cited by 13
Self-citationThe Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3
Longa, P., Wang, W., & Szefer, J. M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84252-9_14 · Cited by 13
A Side-Channel Assisted Attack on NTRU.Preprint
Askeland, A., & Rønjom, S. (2021) · IACR Cryptology ePrint Archive · Cited by 13
Lower Bounds on Lattice Sieving and Information Set Decoding
Kirshanova, E., & Laarhoven, T. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84245-1_27 · Cited by 12
Power-based Side Channel Attack Analysis on PQC Algorithms.Preprint
Kamucheka, T., Fahr, M. J., Teague, T., Nelson, A., Andrews, D. A., & Huang, M. (2021) · IACR Cryptology ePrint Archive · Cited by 12
Efficient BIKE Hardware Design with Constant-Time Decoder
Reinders, A. H., Misoczki, R., Ghosh, S., & Sastry, M. R. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00033 · Cited by 11
(2020) · doi:10.1007/978-3-030-64837-4_12 · Cited by 11
On the Effect of Projection on Rank Attacks in Multivariate Cryptography
Øygarden, M., Smith-Tone, D., & Verbel, J. A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81293-5_6 · Cited by 11
Self-citationLog-$$\mathcal {S}$$-unit Lattices Using Explicit Stickelberger Generators to Solve Approx Ideal-SVP
Bernard, O., Lesavourey, A., Nguyen, T.-H., & Roux-Langlois, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22969-5_23 · Cited by 11
An Exposure Model for Supersingular Isogeny Diffie-Hellman Key Exchange
Koziel, B., Azarderakhsh, R., & Jao, D. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76953-0_24 · Cited by 9
Improved Key Recovery of the HFEv- Signature Scheme.Preprint
Tao, C., Petzoldt, A., & Ding, J. (2020) · IACR Cryptology ePrint Archive · Cited by 9
Sieve, Enumerate, Slice, and Lift:
Doulgerakis, E., Laarhoven, T., & de Weger, B. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51938-4_15 · Cited by 8
Streaming SPHINCS+ for Embedded Devices Using the Example of TPMs
Niederhagen, R., Roth, J., & Wälde, J. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17433-9_12 · Cited by 8
An Optimized Quantum Implementation of ISD on Scalable Quantum ResourcesPreprint
Esser, A., Ramos-Calderer, S., Bellini, E., Latorre, J. I., & Manzano, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.06157 · Cited by 8
A Lightweight Implementation of NTRUEncrypt for 8-bit AVR Microcontrollers
Cheng, H., Großschädl, J., Rønne, P. B., & Ryan, P. Y. A. (2020) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.3947855 · Cited by 6
Non-randomness of S-unit lattices.Preprint
Bernstein, D. J., & Lange, T. (2021) · IACR Cryptology ePrint Archive · Cited by 6
Bernstein, D. J., Brumley, B. B., Chen, M.-S., & Tuveri, N. (2021) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.5833026 · Cited by 6
Aragon, N., Gaborit, P., & Zémor, G. (2020) · arXiv · doi:10.48550/arxiv.2005.10741 · Cited by 4
Analysis of the BIKE post-quantum cryptographic protocols and the Legendre pseudorandom function
Kostić, D. (2020) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-7212 · Cited by 4
Improved Torsion-Point Attacks on SIDH Variants
de Quehen, V., Kutas, P., Leonardi, C., Martindale, C., Panny, L., Petit, C., & Stange, K. E. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84252-9_15 · Cited by 4
Safe-Error Analysis of Post-Quantum Cryptography Mechanisms
Bettale, L., Montoya, S., & Renault, G. (2021) · HAL · Cited by 3
On the Timing Leakage of the Deterministic Re-encryption in HQC KEMPreprint
Hlauschek, C., Lahr, N., & Schröder, R. L. (2021) · IACR Cryptology ePrint Archive · Cited by 3
On Algebraic Embedding for Unstructured Lattices
Bolboceanu, M., Brakerski, Z., & Sharma, D. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-57725-3_5 · Cited by 2
Nice Attacks — but What is the Cost?Computational Models for CryptanalysisPreprint
Bouillaguet, C. (2022) · HAL · Cited by 2
Cited by
Abbasi, M., Cardoso, F., Váz, P., Silva, J., & Martins, P. (2025) · Cryptography · doi:10.3390/cryptography9020032 · Cited by 76
Quantum permutation pad for quantum secure symmetric and asymmetric cryptography
Kuang, R. (2025) · Academia Quantum · doi:10.20935/acadquant7457 · Cited by 4
Post-quantum XML and SAML Single Sign-On
Müller, J., & Oupický, J. (2024) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2024-0128 · Cited by 2
Segar, N., & Vijayan, V. (2026) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2026.1804943 · Cited by 5
Metadata
- Authors
- Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., Peralta, R., Perlner, R., Robinson, A., & Smith-Tone, D.
- Published
- 2022-07-05
- OpenAlex
- W4226075590
- Cited by
- 395
- References
- 259
- Type
- report
- Language
- en
- Open access
- gold
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
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.