Post-Quantum Cryptography Standardization[1] is a program and competition by NIST to update their standards to include post-quantum cryptography.[2] It was announced at PQCrypto 2016.[3] 23 signature schemes and 59 encryption/KEM schemes were submitted by the initial submission deadline at the end of 2017[4] of which 69 total were deemed complete and proper and participated in the first round. Seven of these, of which 3 are signature schemes, have advanced to the third round, which was announced on July 22, 2020.
On August 13, 2024, NIST released final versions of the first three Post Quantum Crypto Standards.[5]
Background
Academic research on the potential impact of quantum computing dates back to at least 2001.[6] A NIST published report from April 2016 cites experts that acknowledge the possibility of quantum technology to render the commonly used RSA algorithm insecure by 2030.[7] As a result, a need to standardize quantum-secure cryptographic primitives was pursued. Since most symmetric primitives are relatively easy to modify in a way that makes them quantum resistant, efforts have focused on public-key cryptography, namely digital signatures and key encapsulation mechanisms. In December 2016 NIST initiated a standardization process by announcing a call for proposals.[8]
The competition is now in its third round out of expected four, where in each round some algorithms are discarded and others are studied more closely. NIST hopes to publish the standardization documents by 2024, but may speed up the process if major breakthroughs in quantum computing are made.
It is currently undecided whether the future standards will be published as FIPS or as NIST Special Publication (SP).
Round one
Under consideration were:[9]
(strikethrough means it had been withdrawn)
| Type | PKE/KEM | Signature | Signature & PKE/KEM |
|---|---|---|---|
| Lattice |
|
|
|
| Code-based |
|
|
|
| Hash-based |
|
||
| Multivariate |
|
|
|
| Braid group |
|
||
| Supersingular elliptic curve isogeny | |||
| Satirical submission | |||
| Other |
|
|
Round one submissions published attacks
- Guess Again by Lorenz Panny [17]
- RVB by Lorenz Panny[18]
- RaCoSS by Daniel J. Bernstein, Andreas Hülsing, Tanja Lange and Lorenz Panny[19]
- HK17 by Daniel J. Bernstein and Tanja Lange[20]
- SRTPI by Bo-Yin Yang[21]
- WalnutDSA
- DRS by Yang Yu and Léo Ducas [24]
- DAGS by Elise Barelli and Alain Couvreur[25]
- Edon-K by Matthieu Lequesne and Jean-Pierre Tillich[26]
- RLCE by Alain Couvreur, Matthieu Lequesne, and Jean-Pierre Tillich[27]
- Hila5 by Daniel J. Bernstein, Leon Groot Bruinderink, Tanja Lange and Lorenz Panny[28]
- Giophantus by Ward Beullens, Wouter Castryck and Frederik Vercauteren[29]
- RankSign by Thomas Debris-Alazard and Jean-Pierre Tillich [30]
- McNie by Philippe Gaborit;[31] Terry Shue Chien Lau and Chik How Tan [32]
Round two
Candidates moving on to the second round were announced on January 30, 2019. They are:[33]
| Type | PKE/KEM | Signature |
|---|---|---|
| Lattice | ||
| Code-based | ||
| Hash-based |
| |
| Multivariate | ||
| Supersingular elliptic curve isogeny | ||
| Zero-knowledge proofs |
|
Round three
On July 22, 2020, NIST announced seven finalists ("first track"), as well as eight alternate algorithms ("second track"). The first track contains the algorithms which appear to have the most promise, and will be considered for standardization at the end of the third round. Algorithms in the second track could still become part of the standard, after the third round ends.[53] NIST expects some of the alternate candidates to be considered in a fourth round. NIST also suggests it may re-open the signature category for new schemes proposals in the future.[54]
On June 7–9, 2021, NIST conducted the third PQC standardization conference, virtually.[55] The conference included candidates' updates and discussions on implementations, on performances, and on security issues of the candidates. A small amount of focus was spent on intellectual property concerns.
Finalists
| Type | PKE/KEM | Signature |
|---|---|---|
| Lattice |
|
|
| Code-based |
|
|
| Multivariate |
|
Alternate candidates
| Type | PKE/KEM | Signature |
|---|---|---|
| Lattice |
|
|
| Code-based | ||
| Hash-based |
| |
| Multivariate |
| |
| Supersingular elliptic curve isogeny | ||
| Zero-knowledge proofs |
|
Intellectual property concerns
After NIST's announcement regarding the finalists and the alternate candidates, various intellectual property concerns were voiced, notably surrounding lattice-based schemes such as Kyber and NewHope. NIST holds signed statements from submitting groups clearing any legal claims, but there is still a concern that third parties could raise claims. NIST claims that they will take such considerations into account while picking the winning algorithms.[56]
Round three submissions published attacks
- Rainbow: by Ward Beullens on a classical computer[57]
Adaptations
During this round, some candidates have shown to be vulnerable to some attack vectors. It forces these candidates to adapt accordingly:
Selected Algorithms 2022
On July 5, 2022, NIST announced the first group of winners from its six-year competition.[60][61]
| Type | PKE/KEM | Signature |
|---|---|---|
| Lattice | ||
| Hash-based |
Round four
On July 5, 2022, NIST announced four candidates for PQC Standardization Round 4.[62]
| Type | PKE/KEM |
|---|---|
| Code-based | |
| Supersingular elliptic curve isogeny |
Round four submissions published attacks
- SIKE: by Wouter Castryck and Thomas Decru on a classical computer[64]
First release
On August 13, 2024, NIST released final versions of its first three Post Quantum Crypto Standards.[5] According to the release announcement:
While there have been no substantive changes made to the standards since the draft versions, NIST has changed the algorithms’ names to specify the versions that appear in the three finalized standards, which are:
- Federal Information Processing Standard (FIPS) 203, intended as the primary standard for general encryption. Among its advantages are comparatively small encryption keys that two parties can exchange easily, as well as its speed of operation. The standard is based on the CRYSTALS-Kyber algorithm, which has been renamed ML-KEM, short for Module-Lattice-Based Key-Encapsulation Mechanism.
- FIPS 204, intended as the primary standard for protecting digital signatures. The standard uses the CRYSTALS-Dilithium algorithm, which has been renamed ML-DSA, short for Module-Lattice-Based Digital Signature Algorithm.
- FIPS 205, also designed for digital signatures. The standard employs the Sphincs+ algorithm, which has been renamed SLH-DSA, short for Stateless Hash-Based Digital Signature Algorithm. The standard is based on a different math approach than ML-DSA, and it is intended as a backup method in case ML-DSA proves vulnerable.
- Similarly, when the draft FIPS 206 standard built around FALCON is released, the algorithm will be dubbed FN-DSA, short for FFT (fast-Fourier transform) over NTRU-Lattice-Based Digital Signature Algorithm.
Additional Digital Signature Schemes Round One
NIST received 50 submissions and deemed 40 to be complete and proper according to the submission requirements.[65] Under consideration are:[66]
(strikethrough means it has been withdrawn)
| Type | Signature |
|---|---|
| Lattice | |
| Code-based | |
| MPC-in-the-Head | |
| Multivariate |
|
| Supersingular elliptic curve isogeny | |
| Symmetric-based | |
| Other |
|
Additional signature round one submissions published attacks
- 3WISE by Daniel Smith-Tone[83]
- EagleSign by Mehdi Tibouchi[97]
- KAZ-SIGN by Daniel J. Bernstein;[98] Scott Fluhrer[99]
- Xifrat1-Sign.I by Lorenz Panny[100]
- eMLE-Sig 2.0 by Mehdi Tibouchi[101]
- HPPC by Ward Beullens[102];Pierre Briaud, Maxime Bros, and Ray Perlner[103]
- ALTEQ by Markku-Juhani O. Saarinen[104] (implementation only?)
- Biscuit by Charles Bouillaguet[105]
- MEDS by Markku-Juhani O. Saarinen and Ward Beullens[106] (implementation only)
- FuLeeca by Felicitas Hörmann and Wessel van Woerden[107]
- LESS by the LESS team (implementation only)[108]
- DME-Sign by Markku-Juhani O. Saarinen[109] (implementation only?); Pierre Briaud, Maxime Bros, Ray Perlner, and Daniel Smith-Tone[110]
- EHTv3 by Eamonn Postlethwaite and Wessel van Woerden;[111] Keegan Ryan and Adam Suhl[112]
- Enhanced pqsigRM by Thomas Debris-Alazard, Pierre Loisel and Valentin Vasseur;[113] Pierre Briaud, Maxime Bros, Ray Perlner and Daniel Smith-Tone[114]
- HAETAE by Markku-Juhani O. Saarinen[115] (implementation only?)
- HuFu by Markku-Juhani O. Saarinen[116]
- SDitH by Kevin Carrier and Jean-Pierre Tillich;[117] Kevin Carrier, Valérian Hatey, and Jean-Pierre Tillich[118]
- VOX by Hiroki Furue and Yasuhiko Ikematsu[119]
- AIMer by Fukang Liu, Mohammad Mahzoun, Morten Øygarden, Willi Meier[120]
- SNOVA by Yasuhiko Ikematsu and Rika Akiyama[121]
- PROV by Ludovic Perret, and River Moreira Ferreira[122] (implementation only)
See also
- Advanced Encryption Standard process
- CAESAR Competition – Competition to design authenticated encryption schemes
- Lattice-based cryptography
- NIST hash function competition
References
External links
Wikiwand in your browser!
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
