Invited Speakers

Yevgeniy Dodis: New York University

Title: Random Number Generation and Extraction

Abstract: Generating random numbers is an essential task in cryptography. The lack of insurance about the generated random numbers can cause serious damages in cryptographic protocols, and vulnerabilities that can be exploited by attackers. In this talk we revisit a surprisingly rich landscape of the area of random number generation, ranging from theoretical impossibility results to building real- world pseudo-random number generators (PRNGs) for Windows, Apple and Linux. Some example topics include impossibility of basing cryptography on entropy alone, improved key derivation functions, seedless randomness extraction, design and analysis of ”super-fast” entropy accumulation found in most modern PRNGs, and post-compromise security of PRNGs in light of ”premature next” attacks.

Yevgeniy is a Fellow of the IACR and a Professor of Computer Science at New York University.
Yevgeniy has worked in a variety of areas in cryptography and network security. In addition to being an IACR Fellow, Dr. Dodis is the recipient of 2021 and 2019 IACR Test-of-Time Awards , NFS CAREER Award, Faculty Awards from Facebook, Google, IBM Algorand, Protocol Labs, JP Morgan and VMware. He has more than 150 scientific publications at various top venues, was the Program co-Chair for the 2022 CRYPTO and 2015 Theory of Cryptography Conference, the editor of Journal of Cryptology (2012-2019), has been on program committees of many international conferences (including FOCS, STOC, CRYPTO and Eurocrypt), and gave numerous invited lectures and courses at various venues.

Alice Pellet-Mary: CNRS

Title: Lattice-based cryptography, the picture way

Abstract: When working on lattice-based cryptography, two main formalisms co-exists. One, let us call it the matrix formalism, where the problems are described with matrices, usually formulated as finding a short solution of a linear system. And another one, let us call it the geometric formalism, where the problems are defined with lattices, and the goal is usually to find short non-zero vectors in these lattices.
The matrix formalism is mostly used when constructing cryptographic protocols, whereas the geometric formalism is often used in cryptanalysis. In this talk, I plan to describe a few results, usually formulated with the matrix formalism, in the geometric formalism. In addition to providing the opportunity to draw nice pictures, we will see that keeping in mind the geometric formalism may help us understand the motivations behind some cryptographic constructions, as well as get an intuition about the hardness of some algorithmic problems.


Alice is a CNRS researcher (chargée de recherche) at the University of Bordeaux.
Alice received a PhD in 2019 in the LIP laboratory, ENS de Lyon. She has been postdoctoral researcher in the COSIC team of KU Leuven, from 2019 to 2021.

Alice research focuses on  lattice based cryptography, and more specifically in the hardness of algorithmic problems related to algebraically structured lattices.