Organizer: Prof. Johannes Buchmann, Moritz Horsch
Over the last years, lattice-based cryptography turned out to be a candidate once practical quantum computers exist. The security of lattice-based cryptographic primitives is based on lattice problems such as the shortest vector problem. In order to instantiate lattice based primitives, it is necessary to know how hard it is to solve the underlying lattice problems. Thus, we provide an overview of currently existing sieving algorithms and pick some of them to have a closer look. Recently, several nearest neighbor techniques were used to further improve these algorithms, hence, we also describe some of these techniques and how they are used to improve sieving algorithms.