Thijs Laarhoven

Thijs Laarhoven received his Ph.D. in applied mathematics from the Eindhoven University of Technology in February 2016. After a postdoc at IBM Research in Zürich, Switzerland, he moved back to the Netherlands, funded by a Dutch NWO Veni grant for excellent young researchers. His main research topic is the average-case hardness of lattice problems in the context of lattice cryptanalysis, with a focus on exponential-space algorithms such as lattice sieving and Voronoi cell approaches. The present work continues in this direction, studying the strengths and limitations of the dual attack for classical hard lattice problems such as the closest vector problem (CVP) and its preprocessing variant (CVPP).