Lattice Signatures Schemes


March 24, 2014


Vadim Lyubashevsky


École Normale Supérieure


Recent work has solidly established lattice-based signatures as a viable replacement for number-theoretic schemes should quantum computing come into fruition. In fact, the current lattice-based schemes have key and signature sizes comparable to RSA while being an order of magnitude faster. The main focus of this talk will be presenting the main ideas behind the latest results in this area. In addition to the high level intuition, I will try to motivate the many employed optimizations, such as having an NTRU-like public key and sampling from a bimodal Gaussian distribution.

Most of the talk will be based on the papers “Lattice Signatures without Trapdoors” and “Lattice Signatures and Bimodal Gaussians”. The latter is joint work with Leo Ducas, Alain Durmus, and Tancrede Lepoint.


Vadim Lyubashevsky

I am an INRIA researcher (chargé de recherche) in the crypto group at the École Normale Supérieure, Paris.

Prior to this, I was a post-doc in the Foundations of Computing group at Tel-Aviv University, hosted by Oded Regev.

I received my Ph.D. from the University of California, San Diego in August 2008, where I was privileged to have Daniele Micciancio as my advisor. My thesis was on building efficient, provably secure cryptographic functions based on the hardness of lattice problems.