T
Thomas Espitau
Researcher at Pierre-and-Marie-Curie University
Publications - 43
Citations - 656
Thomas Espitau is an academic researcher from Pierre-and-Marie-Curie University. The author has contributed to research in topics: Probabilistic logic & Cryptography. The author has an hindex of 12, co-authored 42 publications receiving 450 citations. Previous affiliations of Thomas Espitau include Centre national de la recherche scientifique & University of Paris.
Papers
More filters
Journal Article
GALACTICS: Gaussian Sampling for Lattice-Based Constant-Time Implementation of Cryptographic Signatures, Revisited.
TL;DR: This paper presents careful implementation techniques that allow for an implementation of BLISS with complete timing attack protection, achieving the same level of efficiency as the original unprotected code, without resorting on floating point arithmetic or platform-specific optimizations like AVX intrinsics.
Book ChapterDOI
Relational reasoning via probabilistic coupling
TL;DR: It is shown that the relational program logic pRHL---the logic underlying the EasyCrypt cryptographic proof assistant---already internalizes a generalization of probabilistic coupling, and constructing couplings is no harder than constructing logical proofs.
Posted Content
Adaptive precision LLL and Potential-LLL reductions with Interval arithmetic.
Thomas Espitau,Antoine Joux +1 more
TL;DR: In this article, the authors present an adaptive precision version of LLL and one of its variant Potential-LLL, where floating-point arithmetic is replaced by interval arithmetic, which enables runtime detection of precision defects in numerical computations and accordingly makes it possible to run the reduction algorithms with guaranteed nearly optimal precision.
Journal Article
On a hybrid approach to solve binary-LWE.
TL;DR: This paper improves the classical dual lattice attack and revisits the security estimates of the Fast Fully Homomorphic Encryption scheme over the Torus (TFHE) which is one of the fastest homomorphic encryption schemes based on the LWE problem.
Posted Content
Certified lattice reduction.
Thomas Espitau,Antoine Joux +1 more
TL;DR: In this article, an adaptive-precision version of a generalized LLL algorithm is presented, where the rational arithmetic required by Gram-Schmidt orthogonalization is replaced by floating-point arithmetic.