(REPORTÉ) Rubik’s for cryptographers: Babai’s conjecture, hash functions and quantum gates

Lien vers la page Web de l'orateur

Résumé : Hard mathematical problems are at the core of security arguments in cryptography. In this talk, I will discuss mathematical generalizations of the famous Rubik’s cube puzzle. I will relate them to a conjecture of Babai on the diameter of finite simple groups, to the security of particular cryptographic constructions, to the design of efficient quantum circuits, and more.