Skip to content

Author

Thijs Laarhoven

We have 5 of 50 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

Smooth Sailing through Spherical Shells: Provable Random-Lattice Sieving in Time 20.292n

In an attempt to close the gap between the best provable and heuristic algorithms for hard lattice problems, such as the shortest (SVP) and closest vector problem (CVP), we analyze lattice sieving on Haar-random unimodular lattices. With well-chosen modifications to heuristic sieving, we show that the heuristic assumpt...

Emmanouil Doulgerakis, Thijs Laarhoven · 0 citations
Preprint Oct 2026

Asymptotics of Random-Lattice Enumeration: Beyond HKZ via Dense Sublattices

To bridge the gap between worst-case and heuristic analyses of lattice enumeration, we study the sizes of (unpruned) enumeration trees on $n$-dimensional Haar-random lattices. Writing $n^{cn+o(n)}$ for the tree size at the shortest vector radius, we investigate the asymptotic scaling of $c$, and which bases minimize it...

Thijs Laarhoven · 1 citation · ⚡1
Preprint Sep 2026

Spherical statistics and phase transitions in high-dimensional lattices

We study the spherical statistics of all the points in a thin shell of a high-dimensional random lattice. The exact relations between lattice points make it unclear when predictions based only on spherical geometry should hold. We answer this question for several statistics, including the number of shell points, the ba...

Thijs Laarhoven · 0 citations
Preprint Sep 2026

A lattice family with kissing numbers $\tau(\mathcal{L}_n) \ge e^{2 \sqrt{n}}$

For all prime powers $q\geq5$, we construct lattices $\mathcal{L}_q\subseteq\mathbb{Z}^q$ with kissing numbers \[ \tau(\mathcal{L}_q)\geq \left(\frac{1}{2\pi e^2}+o(1)\right)\sqrt{q}\,e^{2\sqrt{q}}. \] The same asymptotic bound holds on a set of integer dimensions of natural density $1$, and in every sufficiently large...

Thijs Laarhoven, S. Kominers · 0 citations
Preprint Sep 2026

A Note on Sphere Packing Bounds for Tuple Lattice Sieving

A finite set of unit vectors is $k$-irreducible if every signed sum of between two and $k$ distinct elements has norm greater than one. Let $\mathcal{R}_k$ be the maximal asymptotic rate of such sets, and let $\kappa(\alpha)$ be the maximal asymptotic rate of spherical codes with pairwise inner products at most $\alpha...

Thijs Laarhoven · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.