Lattice-Based Cryptography: The Math Behind Post-Quantum Security (opens in new tab)

When NIST chose the algorithms meant to protect the internet from quantum computers, most of the winners came from the same unexpected place: geometry. Not the geometry of triangles, but of infinite grids of points in high-dimensional space, where one innocent-sounding question — what's the nearest grid point to here? — turns out to be brutally hard. That hardness is the new foundation of secure communication. Today's public-key cryptography rests on two problems: factoring large numbers (RSA...