Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice

Provided by: International Association for Cryptologic Research
Topic: Security
Format: PDF
In this paper, the authors report that they have solved the SVP Challenge over a 128-dimensional lattice in Ideal lattice challenge from TU Darmstadt, which is currently the highest dimension in the challenge that has ever been solved. The security of lattice-based cryptography is based on the hardness of solving the Shortest Vector Problem (SVP) in lattices. In 2010, the researchers proposed a gauss sieve algorithm for heuristically solving the SVP using a list L of gauss-reduced vectors. The researchers proposed a parallel implementation method for the Gauss Sieve algorithm.

Find By Topic