Too Long; Didn't Read
Lattice-based cryptography has been in the spotlight recently. Many of the semifinalists in the NIST post-quantum-cryptography competition were based on lattices. Lattices are defined by basis vectors, which are only able to be scaled by integers. With lattices, we can only scale by whole integers. Shor's algorithm on quantum computers can crack RSA in less than exponential time. In this article, we take a brief look at one of the more well-known lattice problems of use in cryptosystems.
Share Your Thoughts