Damien Stehlé

Learning With Errors and Extrapolated Dihedral Cosets

2017 · arXiv (Cornell University)

The hardness of the learning with errors (LWE) problem is one of the most fruitful resources of modern cryptography. In particular, it is one of the most prominent candidates for secure post-quantum cryptography. Understanding its …

Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance.

2015 · IACR Cryptology ePrint Archive

International audience