After completing his study Applied Mathematics at the TU/e in 2011, Thijs Laarhoven started his doctoral research on the topic of cryptography and algorithms, also at the TU/e. In February 2016 he obtained his PhD (with honors) on this subject, under the supervision and guidance of prof. Tanja Lange and dr. Benne de Weger. After finishing his PhD, he went to Switzerland to continue his research at the IBM Research laboratory near Zurich for 1.5 years. Since November 2017 he is now back at the TU/e in prof. Nikhil Bansal's group.
The best scientific research stems from curiosity.
Practical and optimal LSH for angular distanceAdvances in Neural Information Processing Systems (NIPS 2015) (2015)
Sieving for shortest vectors in lattices using angular locality-sensitive hashing35th Annual International Cryptology Conference (CRYPTO 2015), August 16-20, 2015, Santa Barbara, CA, USA (2015)
New directions in nearest neighbor searching with applications to lattice sieving27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016) (2016)
Optimal hashing-based time-space trade-offs for approximate near neighbors28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) (2017)
Finding shortest lattice vectors faster using quantum searchDesigns, Codes and Cryptography (2015)
No ancillary activities