Jules Baudrin | Research
Associate professor in computer science at UVSQ, Versailles, France
I work on cryptography (analysis and design of symmetric primitives) and on discrete mathematics (Boolean functions).

Content
Publications
Direct links: Hal Google Scholar DBLP.
Preprints
- On the Concrete Hardness of LWR with a Power of Two Modulus, Jules Baudrin, Rachelle Heim Boissier, François-Xavier Standaert (2026). article
- From Simple Mathematical Upper Bounds to Tight Tool-based Bounds for the Minimum Number of Active S-boxes in LS-Designs, Jules Baudrin, Rachelle Heim Boissier, Mahnoor Naseer, François-Xavier Standaert (2026). article
- Linear self-equivalence of the known families of APN functions: a unified point of view., Jules Baudrin, Anne Canteaut, Léo Perrin (2024). article
This list is generated using Haltools.
Talks
Conference website globe, slides photo_library and/or recording video_library are provided when available.
This list is manually maintained.
Students
I supervise(d) the following students:
-
Titouan Mousset, Master thesis (UVSQ, Mar–Aug 26).
On the understanding of algebraic and integral attacks, and associated distinguishers. Co-supervised with Yann Rotella. -
Cyprien Gauthier, second year research internship (ENSTA Paris, May-Jul 24)
Searching for optimal S-boxes over $\mathbb{F}_{p}$. Co-supervised with Anne Canteaut & Léo Perrin.
Editorial Activities
I was an external reviewer for the following journals and conferences.
Journals
- Designs, Codes and Cryptography (DCC) 2025, 2026.
- Finite Fields and Their Applications 2022, 2023.
Conferences
- Selected Areas in Cryptography (SAC) 2026.
- Eurocrypt 2026.
- Crypto 2024.
- Information Security Conference (ISC) 2024.
Last updated on 16-06-2026. A fork of no-style-please by Riccardo Graziosi.