Lattice: The Easy and Hard Problem

With lattice cryptography, we create a lattice of points and then introduce a small error in the point, and it then becomes a hard problem to find the nearest point to the point with the error.

Lattice cryptography is seen as a replacement for our existing public-key methods. What is so good about them, is that we have a provably hard problem. So, I’m going to show that this is a hard problem, and is…