en.wikipedia.org/wiki/Post-quantum_cryptography
4 corrections found
Various attempts to build secure multivariate equation encryption schemes have been broken, notably the Rainbow signature.
Rainbow is a digital signature scheme, not an encryption scheme, so it is not an example of a broken multivariate encryption scheme.
Full reasoning
This sentence mixes up two different categories of cryptographic primitive. Rainbow is a signature scheme, not an encryption scheme. So citing “the Rainbow signature” as an example of a broken multivariate equation encryption scheme is incorrect. NIST describes Rainbow as “a roughly 15 year old digital signature scheme based on multivariate systems of equations.”
1 source
- Rainbow Band Separation is Better than we Thought | CSRC
Among the candidates in the second round of the standardization process is Rainbow, a roughly 15 year old digital signature scheme based on multivariate systems of equations.
154 B
This public-key size is off by about an order of magnitude: Open Quantum Safe lists Streamlined NTRU Prime (sntrup761) at 1,158 bytes, not 154 bytes.
Full reasoning
The table gives 154 B as the public-key size for Streamlined NTRU Prime. Open Quantum Safe’s algorithm page for NTRU-Prime lists the supported parameter set sntrup761 with a public key size of 1158 bytes and a secret key size of 1763 bytes. That directly contradicts the 154-byte figure in the article.
1 source
- NTRU-Prime | Open Quantum Safe
Parameter set summary ... sntrup761 ... Public key size (bytes) 1158 ... Secret key size (bytes) 1763 ... Ciphertext size (bytes) 1039
As of March 2023, the following key exchange algorithms are supported:
This date and label are wrong: the list below includes signature schemes, and some of them were only added to liboqs in 2024 or 2025.
Full reasoning
This sentence is incorrect in two ways.
-
The list is not just “key exchange algorithms.” Open Quantum Safe’s current algorithms page separates Key encapsulation mechanisms (KEMs) from Signature schemes. On that page, ML-DSA, SLH-DSA, and Falcon are listed under signature schemes, not under KEMs/key exchange.
-
Several listed algorithms were not supported in March 2023. liboqs release notes show that ML-DSA (FIPS 204 final) was added in version 0.12.0, released December 9, 2024, and SLH-DSA was integrated in version 0.15.0, released November 14, 2025. So a sentence claiming that, as of March 2023, the following algorithms were supported is factually outdated/wrong for the list that follows.
3 sources
- Algorithms | Open Quantum Safe
Algorithms in liboqs ... Key encapsulation mechanisms (KEMs) ... ML-KEM ... HQC ... Kyber ... BIKE ... Classic McEliece ... FrodoKEM ... NTRU ... NTRU-Prime ... Signature schemes ... ML-DSA (FIPS 204 version) ... SLH-DSA (FIPS 205 version) ... Falcon
- Release liboqs version 0.12.0 · open-quantum-safe/liboqs · GitHub
This is version 0.12.0 of liboqs. It was released on December 9, 2024. ... The addition of ML-DSA FIPS 204 final version to liboqs ... Add ML-DSA / FIPS 204 final
- Release liboqs version 0.15.0 · open-quantum-safe/liboqs · GitHub
liboqs 0.15.0 was released on Friday, Nov 14, 2025. ... Integrated SLH-DSA implementation from pq-code-package/slhdsa-c
In 2019, a team using the IBM Q quantum computer could factor the numbers 15 and 21, but not 35.
This is backwards on 35: the 2019 IBM work explicitly studied 15, 21, and 35, and later literature describes that IBM demonstration as factoring all three.
Full reasoning
The claim says the 2019 IBM Q work could factor 15 and 21 but not 35. That is contradicted by the IBM Research publication itself, whose abstract says it studied Shor’s algorithm on IBM hardware for N = 15, 21, and 35. A later Scientific Reports paper discussing prior IBM results is even more explicit, stating that the iterative scheme was demonstrated for factoring 15, 21 and 35 on an IBM quantum processor. So the article’s exclusion of 35 is incorrect.
2 sources
- Experimental study of Shor's factoring algorithm using the IBM Q Experience for Physical Review A - IBM Research
We study the results of a compiled version of Shor's factoring algorithm on the ibmqx5 superconducting chip, for the particular case of N=15, 21, and 35.
- Demonstration of Shor's factoring algorithm for N = 21 on IBM quantum processors | Scientific Reports
Later, the iterative scheme was demonstrated for factoring 15, 21 and 35 on an IBM quantum processor by splitting up the iterations and combining the outcomes.