Summer 2015

The Preprocessing of Lattice Point Enumeration

Wednesday, July 8th, 2015 4:30 pm4:55 pm

Add to Calendar

Enumeration algorithms are the fastest known SVP algorithms in the class of polynomial space algorithms and the go-to algorithms to solve SVP in practice. For this reason it is important to study their practical and asymptotic complexity for cryptanalytic purposes. Both, the practical and asymptotic complexity depend heavily on the preprocessing performed before the main enumeration step and this is where most algorithms differ. In this talk I will discuss recent results on the trade off between preprocessing and enumeration.