Andrei Romashchenko (Université de Montpellier) - Université de Montpellier,
Titre
On Some Problems in Algorithmic Information Theory and Secret Key Agreement Protocols
Date
24/11/2025
Horaire
16:00 à 17:00
Diffusion
Résume
We will review the basic notions and ideas of Kolmogorov complexity theory and focus on its applications to problems in information-theoretic cryptography and communication complexity. We will show that the arising questions are related to problems from various areas of mathematics and require a wide range of techniques — from computability theory to algebra, discrete geometry, graph theory, and topology.
