01Lattices
RSA rests on factoring, elliptic curves on discrete logs — a quantum computer solves both with Shor's algorithm. ML-KEM rests on a different problem: given a matrix A and A·s + e with small noise e, find s. No quantum algorithm is known to do that faster than a classical one.
⋰
02The standard
FIPS 203, published by NIST in August 2024, after a six-year open competition. This page implements it line by line: Keccak, arithmetic in Z₃₃₂₉, the number-theoretic transform, sampling, compression, K-PKE, the KEM with implicit rejection.
◫
03Checked
Six deterministic seeds through this code and through an independent implementation: public keys, private keys, ciphertexts and shared secrets agree byte for byte. SHA-3 and SHAKE match the standard's test vectors. A full exchange takes about 50 ms here.
↗
Sizes: public key 1184 bytes, private key 2400, ciphertext 1088, shared secret 32 — exactly as FIPS 203 specifies for ML-KEM-768.
No server, no request after the page is open. Keys are made here and die with the tab.