1 citations · 1 across the 3 of their papers we have counts for
4 papers
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…
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…
Algorithms on Ideal over Complex Multiplication order
Paul Kirchner
We show in this paper that the Gentry-Szydlo algorithm for cyclotomic orders, previously revisited by Lenstra-Silverberg, can be extended to complex-multiplication (CM) orders, and…
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
Paul Kirchner, Pierre-Alain Fouque
In this paper, we study the Learning With Errors problem and its binary variant, where secrets and errors are binary or taken in a small interval. We introduce a new variant of the…