Activities

Upcoming Activities

No upcoming activities scheduled. Check back soon!


Past Activities

Date Speaker Title Resources
Aug 22 – Aug 28, 2026
Ilaria Chilotti
DESILO, Seoul, Republic of Korea
Claude Crépeau
École de technologie supérieure & McGill University, Canada
Thomas Debris-Alazard
École Polytechnique, Palaiseau, France
Alex Bredariol Grilo
LIP6 (CNRS/Sorbonne Université), France
Ky Nguyen
LIP6 (CNRS/Sorbonne Université), France
Phan Dương Hiệu
Telecom Paris, Institut Polytechnique de Paris, France
IACR-VIASM Summer School on Cryptography 2026 Vietnam Institute for Advanced Study in Mathematics (VIASM), 161 Huynh Thuc Khang Street, Lang Ward, Hanoi More info
Jun 3 – Jun 5, 2026 Prof. Desmedt Gaston Yvo
The University of Texas at Dallas, USA
Mini-course: Secret Sharing, Threshold Cryptography and their Applications Vietnam Institute for Advanced Study in Mathematics (VIASM), 161 Huynh Thuc Khang Street, Lang Ward, Hanoi More info
Mar 25 – Mar 29, 2026 Prof. Alfred Menezes
University of Waterloo, Canada
Mini-course: Introduction to Lattice-based cryptography The public-key cryptographic schemes used in practice to secure communications are known to be completely breakable by quantum computers. Although the timeline for building cryptographically-relevant quantum computers remains uncertain, interest in deploying quantum-resistant cryptosystems has surged. Governments worldwide are promoting standards for quantum-safe cryptography, and industry is beginning to integrate quantum-safe cryptography into their products.

In 2024, the U.S. government's National Institute of Standards and Technology (NIST) published standards for lattice-based key encapsulation and signature schemes, as well as for hash-based signatures. Of these standardized schemes, the lattice-based Kyber key encapsulation mechanism (KEM) and the Dilithium signature scheme are seeing the broadest adoption.

This course introduces lattice-based cryptography, focusing on the design and analysis of the Kyber key encapsulation mechanism. Kyber's security is based on the Module Learning With Errors (MLWE) problem, which involves solving noisy linear equations over a polynomial ring. After describing Kyber, I'll explain its connection to lattice problems. I'll then introduce the LLL lattice basis reduction algorithm, a fundamental tool for analyzing hardness of lattice-based cryptosystems.
Vietnam Institute for Advanced Study in Mathematics (VIASM), 161 Huynh Thuc Khang Street, Hanoi
More info