Arthur Gontier

Hi there! I am Arthur Gontier. Since January 2024, I am a researcher in the FATA team in the University of Glasgow. I am working with Ciaran McCreesh on constraint solvers that produces proofs of reasoning.

Before that, I was a PhD student in symmetric cryptanalysis with declarative languages in the CAPSULE team in Rennes supervised by Stéphanie Delaune, Patrick Derbez and Charles Prud'homme. My PhD thesis can be found here. I was working on symmetric cryptanalysis problems like Cube attacks or Differential attacks. To do so, I used several solvers or even dedicated algorithms.

In these three years, we published three papers in cryptography related conferences where we used many optimisation methods, (CP MILP SAT and dedicated algorithms). To tackle the hard problems of cryptography with CP, we often needed to make new constraints. Indeed, there are very specific cryptographic properties we modeled in graph constraints or set constraints for solvers like Choco and Chuffed.

I also worked on explanations and conflict analysis. In a CP 2020 workshop, we proposed an explanation generator to help the use of explanations in CP solvers.

Finally, I participated to TAGADA, a generic tool to perform differential cryptanalysis on generic block ciphers with constraint programming. The idea is the following: anyone can model any cipher and the tool will perform differential cryptanalysis on it.

Before that, I had a Master's Degree in Nantes and Bruxelles focusing on optimisation techniques with CP teachers like Nicolas Beldiceanu and Eric Monfroy. I also did several research internships, on multi objective optimisation, static program analysis and CP explanations. Feel free to check my CV for more details.

Publications

Teaching

Contact me

Find me