Publications
Google ScholarDBLParXivBibTeX
2026
- Superlattice methods for the shortest vector problem and discrete Gaussian sampling
Minki Hhan, Jiseung Kim, Sunyeop Kim, Thijs Laarhoven
Preprint
- Asymptotics of Random-Lattice Enumeration: Beyond HKZ via Dense Sublattices
Thijs Laarhoven
Preprint
- Dual lattice attacks for bounded distance decoding, revisited
Thijs Laarhoven
Preprint
- Smooth Sailing through Spherical Shells: Provable Random-Lattice Sieving in Time 20.292n
Emmanouil Doulgerakis, Thijs Laarhoven
Preprint
- Spherical statistics and phase transitions in high-dimensional lattices
Thijs Laarhoven
Preprint
- A lattice family with kissing numbers τ(ℒn) ≥ e2√n
Thijs Laarhoven, Scott Duke Kominers
Preprint
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving
Thijs Laarhoven
Preprint
2021
- Lower Bounds on Lattice Sieving and Information Set Decoding
Elena Kirshanova, Thijs Laarhoven
CRYPTO 2021
- Dual lattice attacks for closest vector problems (with preprocessing)
Thijs Laarhoven, Michael Walter
CT-RSA 2021
- Approximate Voronoi cells for lattices, revisited
Thijs Laarhoven
Journal of Mathematical Cryptology
2020
- Polytopes, lattices, and spherical codes for the nearest neighbor problem
Thijs Laarhoven
ICALP 2020
- Sieve, enumerate, slice, and lift: Hybrid lattice algorithms for SVP via CVPP
Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger
AfricaCrypt 2020
- The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier
Léo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden
PKC 2020
2019
- Evolutionary techniques in lattice sieving algorithms
Thijs Laarhoven
ECTA 2019
Best Paper Award
- Nearest neighbor decoding for Tardos fingerprinting codes
Thijs Laarhoven
IH&MMSec 2019
- Round5: Compact and fast post-quantum public-key encryption
Hayo Baan, Sauvik Bhattacharya, Scott Fluhrer, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang
PQCrypto 2019
- Finding closest lattice vectors using approximate Voronoi cells
Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger
PQCrypto 2019
2018
- Graph-based time-space trade-offs for approximate near neighbors
Thijs Laarhoven
SoCG 2018
- Progressive lattice sieving
Thijs Laarhoven, Artur Mariano
PQCrypto 2018
- Speed-ups and time-memory trade-offs for tuple lattice sieving
Gottfried Herold, Elena Kirshanova, Thijs Laarhoven
PKC 2018
2017
- Hypercube LSH for approximate near neighbors
Thijs Laarhoven
MFCS 2017
- A parallel variant of LDSieve for the SVP on lattices
Artur Mariano, Thijs Laarhoven, Christian Bischof
PDP 2017
- Faster tuple lattice sieving using spherical locality-sensitive filters
Thijs Laarhoven
Preprint
- A practical view of the state-of-the-art of lattice-based cryptanalysis
Artur Mariano, Thijs Laarhoven, Fábio Correia, Manuel Rodrigues, Gabriel Falcao
IEEE Access
- Optimal hashing-based time-space trade-offs for approximate near neighbors
Alexandr Andoni, Thijs Laarhoven, Ilya Razenshteyn, Erik Waingarten
SODA 2017
Invited to the ACM Transactions on Algorithms
2016
- Sieving for closest lattice vectors (with preprocessing)
Thijs Laarhoven
SAC 2016
- Tuple lattice sieving
Shi Bai, Thijs Laarhoven, Damien Stehlé
ANTS 2016
- Lower bounds on time-space trade-offs for approximate near neighbors
Alexandr Andoni, Thijs Laarhoven, Ilya Razenshteyn, Erik Waingarten
Preprint
- Efficient (ideal) lattice sieving using cross-polytope LSH
Anja Becker, Thijs Laarhoven
AfricaCrypt 2016
- Search problems in cryptography
Thijs Laarhoven
PhD Thesis
Graduated cum laude
- New directions in nearest neighbor searching with applications to lattice sieving
Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven
SODA 2016
- Asymptotics of fingerprinting and group testing: Capacity-achieving log-likelihood decoders
Thijs Laarhoven
EURASIP Journal on Information Security
2015
- Tradeoffs for nearest neighbors on the sphere
Thijs Laarhoven
Preprint
- Practical and optimal LSH for angular distance
Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya Razenshteyn, Ludwig Schmidt
NeurIPS 2015
- Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP
Artur Mariano, Thijs Laarhoven, Christian Bischof
ICPP 2015
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
Thijs Laarhoven, Benne de Weger
LatinCrypt 2015
- Sieving for shortest vectors in lattices using angular locality-sensitive hashing
Thijs Laarhoven
CRYPTO 2015
- Asymptotics of fingerprinting and group testing: tight bounds from channel capacities
Thijs Laarhoven
IEEE Transactions on Information Forensics and Security
- Optimal sequential fingerprinting: Wald vs. Tardos
Thijs Laarhoven
IH&MMSec 2015
Best Paper Award
- Finding shortest lattice vectors faster using quantum search
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Designs, Codes and Cryptography
2014
- Capacities and capacity-achieving decoders for various fingerprinting games
Thijs Laarhoven
IH&MMSec 2014
Best Student Paper Award
- Optimal symmetric Tardos traitor tracing schemes
Thijs Laarhoven, Benne de Weger
Designs, Codes and Cryptography
- Tuple decoders for traitor tracing schemes
Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven
SPIE 2014
2013
- Dynamic traitor tracing schemes, revisited
Thijs Laarhoven
WIFS 2013
- Efficient probabilistic group testing based on traitor tracing
Thijs Laarhoven
Allerton 2013
- Discrete distributions in the Tardos scheme, revisited
Thijs Laarhoven, Benne de Weger
IH&MMSec 2013
- The Collatz conjecture and De Bruijn graphs
Thijs Laarhoven, Benne de Weger
Indagationes Mathematicae
- Solving the shortest vector problem in lattices faster using quantum search
Thijs Laarhoven, Michele Mosca, Joop van de Pol
PQCrypto 2013
- Dynamic Tardos traitor tracing schemes
Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Škorić, Benne de Weger
IEEE Transactions on Information Theory
2012
- Dynamic traitor tracing for arbitrary alphabets: Divide and conquer
Thijs Laarhoven, Jan-Jaap Oosterwijk, Jeroen Doumen
WIFS 2012
Best Paper Award
- Dynamic Tardos traitor tracing schemes
Peter Roelse, Jeroen Doumen, Thijs Laarhoven
Patent
- Solving hard lattice problems and the security of lattice-based cryptosystems
Thijs Laarhoven, Joop van de Pol, Benne de Weger
Preprint