Tag
5 articles with this tag.
BIKE is a post-quantum key encapsulation scheme built on codes with a sparse parity-check matrix. Learn how its keys hide a sparse code in a dense one, how the Black-Gray-Flip decoder removes the error, why one flipped bit is rejected, and why NIST chose HQC instead.
30 min read
FrodoKEM deliberately throws away the algebraic structure that makes lattice cryptography fast. It trades performance for a security proof that rests on plain, 'vanilla' Learning With Errors. Learn how it works and why some cryptographers prefer that trade.
10 min read
In March 2025, NIST picked a second code-based algorithm to back up Kyber. This one hides its noise completely differently from McEliece. Learn how HQC masks a public, unscrambled code with pure algebraic randomness instead.
10 min read
The key encapsulation mechanism NIST chose to replace RSA and ECDH for general-purpose use. Learn how Kyber hides a noisy linear system inside a polynomial ring to get both lattice-hard security and real-world speed.
9 min read
SABER reached the final round of NIST's post-quantum competition with a trick Kyber doesn't use: instead of adding random noise, it rounds numbers down and lets the rounding error itself do the job. Learn how Learning With Rounding works.
10 min read
