Lattice-based cryptography has been coming into the spotlight recently. In January 2019, Many of the semifinalists in the NIST post-quantum-cryptography competition were based on lattices. Lattice based cryptography has promising aspects that make it a contender for the basis of cryptographic security in a post-quantum world.
What is a Lattice?
According to Wikipedia, a lattice is the set of all integer linear combinations of basis vectors:
More simply put, a lattice is defined by basis vectors, which are only able to be scaled by integers… yay no fractions!
For example, let’s create a lattice of all the integers in a two-dimensional plane:
The definition of our lattice contains only 2 basis vectors,
v1 = (0,1)
v2 = (1,0)
Our lattice is the set of all values that can be reached by any combination and scale of our basis vectors. For example, the point (2,0) is in our lattice because it can be reached by 2*v1
Similarly, we could create an entirely new lattice by changing our basis vectors to
v1 = (0,3)
v2 = (3,0)
As you can see, now the intermediary points (0,1) and (0,1) no longer exist in our lattice. There is no way to scale v1 (0,3) and v2 (3,0) to reach those points without using fractional scalars. With lattices, we can only scale by whole integers.
How Does This Help With Crypto?
Cryptographic algorithms are typically based on mathematical problems that are easy to verify the answer of, but hard to calculate.
For example, RSA is based on prime factorization. If I told you to find prime factors of 27,919,645,564,169,759, that would be hard. However, if I told you that 48,554,491 and 575,016,749 are prime factors, all you have to do is multiply them together in order to verify my answer.
RSA works great with classical computers. There are no known solutions to find prime factors of a number reliably in less than exponential time.
In the quantum world, things don’t look so peachy. Shor’s algorithm on quantum computers can crack RSA in less than exponential time. For this reason, we need quantum-safe algorithms. Many believe that lattice math could be an answer.
Shortest Vector Problem
The shortest vector problem (SVP) is one of the fundamentals problems presented by lattices that allow them to be useful in cryptography.
Simply put, the goal of SVP is for the attacker to find the shortest vector from the origin (above in red) when given the basis of a lattice (above in blue). A zero vector doesn’t work as an answer, we consider it trivial.
How is it solved?
Like RSA with classical computers, it is hard to find the shortest vector of a large lattice, especially if it exists in many dimensions. One such slow solution for approximating the shortest vector is Babai‘s algorithm, or Nearest Plane Algorithm, which you can read about in the links provided.