209 citations · 489 across the 24 of their papers we have counts for
4 papers · 1 filter
Approximate Voronoi cells for lattices, revisited
Thijs Laarhoven
We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doul…
Evolutionary techniques in lattice sieving algorithms
Thijs Laarhoven
Lattice-based cryptography has recently emerged as a prominent candidate for secure communication in the quantum age. Its security relies on the hardness of certain lattice problem…
Polytopes, lattices, and spherical codes for the nearest neighbor problem
Thijs Laarhoven
We study locality-sensitive hash methods for the nearest neighbor problem for the angular distance, focusing on the approach of first projecting down onto a low-dimensional subspac…
Nearest neighbor decoding for Tardos fingerprinting codes
Thijs Laarhoven
Over the past decade, various improvements have been made to Tardos' collusion-resistant fingerprinting scheme [Tardos, STOC 2003], ultimately resulting in a good understanding of…