Benjamin Wesolowski obtained his PhD in 2018 at the École Polytechnique Fédérale de Lausanne (EPFL, Switzerland) on arithmetic and geometric structures in public key cryptography. After a post-doc at the Cryptology Group of the Centrum Wiskunde & Informatica (CWI, The Netherlands), he joined the Institut de Mathématiques de Bordeaux as a CNRS research scientist, where he is now a member of the number theory team.
His research concerns various facets of cryptology, with a particular focus on cryptologic algorithms related to number theory and algebraic geometry. He has contributed to the cryptanalysis of schemes based on lattices, isogenies, and discrete logarithms in finite fields.
August 24th, 2021 | 46 mins 52 secs
Benjamin Wesolowski talks about his latest paper in which he mathematically proved that the two fundamental problems underlying isogeny-based cryptography are equivalent.