36 citations · 37 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020★ 1 cited
The nearest-colattice algorithm
Thomas Espitau, Paul Kirchner
In this work, we exhibit a hierarchy of polynomial time algorithms solving approximate variants of the Closest Vector Problem (CVP). Our first contribution is a heuristic algorithm…
cs.DS2019
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond
Thomas Espitau, Paul Kirchner, Pierre-Alain Fouque
We introduce a framework generalizing lattice reduction algorithms to module lattices in order to practically and efficiently solve the -Hermite Module-SVP problem over arbitrar…