How Lattice Encryption Works, a Worked Example With Real Numbers

Almost every explanation of lattice encryption stops at the metaphor. You are told that a lattice is a grid of points, that finding the nearest one is hard, and that this hardness is what will protect your data from a future quantum computer. All of that is true, and none of it lets you see the thing actually work. This page does the arithmetic instead. We pick numbers small enough to check with a pencil, build a key, encrypt a single bit, and decrypt it, showing every intermediate value. Then we push the noise until the bit flips, break the scheme twice on purpose, and finish by mapping each piece onto ML-KEM, the standard the world is now deploying. Every number below was produced by Python that was executed rather than imagined, and the script is short enough to be printed in full further down. If you want the concepts behind it, the geometry and the hard problems and the standards landscape, our guide to lattice-based cryptography covers that ground. This one is the calculator. Lattice encryption is one noisy equation. A public key is a set of linear equations in the secret, each spoiled by a small error, and…