Loading CryptoViz...
Loading page content...Loading CryptoViz...
Loading page content...Curious why we need Post-Quantum Cryptography like FrodoKEM? Explore our Quantum Cryptanalysis lab to see Shor's and Grover's algorithms in action.
Explore Learning With Errors (LWE) matrix mathematics and contrast FrodoKEM with ML-KEM (Kyber).
Real FrodoKEM-640 uses 640Γ640 matrices
Discrete noise added for LWE security
Encoded into matrix hints
B = A Γ S + E (mod q)Public Key matrix B is calculated by multiplying public matrix A with secret matrix S, then adding discrete noise matrix E. Without noise E, finding S would be easy using Gaussian elimination. With noise E, it becomes computationally intractable (LWE problem).
Pseudorandomly generated from seed_A
Private key sampled from discrete Gaussian noise
Small error terms added to mask the product
Transmitted to sender for key encapsulation
Continue your cryptography learning path
Post-quantum digital signatures (NIST FIPS 204, formerly Dilithium), pairing with ML-KEM the same way Ed25519 pairs with X25519 classically β except the hard problem here is lattice-based (Module-LWE/SIS), not elliptic-curve discrete log.
Lattice-based public-key cryptosystem (IEEE P1363.1, 1996). Operates in polynomial ring Z[x]/(x^N-1). Predates NIST PQC by 20+ years. WARNING: Visualizer uses small pedagogical parameters (N=11) for teaching; NOT secure at this size.