42 citations · 115 across the 8 of their papers we have counts for
10 papers
Recursive lattice reduction -- A framework for finding short lattice vectors
Divesh Aggarwal, Thomas Espitau, Spencer Peters +1
We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense subl…
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…
Certified lattice reduction
Thomas Espitau, Antoine Joux
Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lens…
An Assertion-Based Program Logic for Probabilistic Programs
Gilles Barthe, Thomas Espitau, Marco Gaboardi +3
Research on deductive verification of probabilistic programs has considered expectation-based logics, where pre- and post-conditions are real-valued functions on states, and assert…
Proving Expected Sensitivity of Probabilistic Programs
Gilles Barthe, Thomas Espitau, Benjamin Grégoire +2
Program sensitivity, also known as Lipschitz continuity, describes how small changes in a program's input lead to bounded changes in the output. We propose an average notion of pro…