Vadim Lyubashevsky  Vadim Lyubashevsky photo       

contact information

Cryptography Researcher
Zurich Research Laboratory, Ruschlikon, Switzerland


Professional Associations

Professional Associations:  International Association for Cryptologic Research (IACR)

Foundations of Efficient Lattice Cryptography (FELICITY)

ERC Starting Transfer Grant  SNSF-CRETP2-166734  (2016 - 2020)

Public key cryptography is the backbone of internet security, but most of the current mathematical assumptions that it relies on can be broken by quantum computers. Lattice cryptography is viewed as the most promising candidate to take over as the basis for cryptography in the future. The FELICITY project is pushing the boundaries of what that can be efficiently built based on the hardness of lattice problems.

dfd part2 part3

1. Foundational


2. Standardization of

Encryption and Signatures

3. Advanced



1. Public key cryptographic protocols are constructed so that they are based on the hardness of some mathematical problem.   We want the problem to be hard, but at the same time, for it to be possible to construct practical schemes based on it.  In this part of the project, we address the following fundamental questions:

  • Which problems can form the basis of efficient schemes under quantum reductions?
  • Which problems can form the basis of “advanced” cryptographic schemes?







2. In 2015, the NSA released a document stating that the next generation of algorithms securing internet communication should be resistant to quantum attacks. In 2017, NIST began the standardization process for choosing post-quantum encryption, key exchange, and digital signature schemes.  Together with a consortium of university and industry partners, we have submitted our lattice-based proposals as part of the CRYSTALS and FALCON packages. Our proposals are based on well-studied lattice problems and show that one can have security against quantum attackers with little added overhead.       


3. Beyond the basic schemes that secure internet communication, there is also an emerging need for more “advanced” privacy-preserving protocols.  The research is just beginning, and there are currently very few protocols beyond basic encryption and signature schemes that can be considered truly practical.  Some of the more advanced primitives whose efficient foundations we will be building in this project include:

  • Zero-Knowledge proofs
  • Electronic voting schemes
  • Privacy-preserving primitives




Project Members

PI: Vadim Lyubashevsky

Rafael del Pino (Ph.D. Student 2016 - )

Gregory Neven (Permananent Researcher at IBM)

Gregor Seiler (Ph.D. Student 2017 - )


Former Members

Thijs Laarhoven (Postdoc March 2016 - September 2017)