About Me

I am a postdoctoral researcher in Computational Algebra at Eötvös Loránd University, under the supervision of Péter Kutas.
My research interests lie in algorithmic number theory, computer algebra and cryptography. My current research focuses on the cryptanalysis of post-quantum protocols, mainly those based on multivariate polynomials or isogenies.

Selected Publications

• Wouter Castryck, Mingjie Chen, Péter Kutas, Jun Bo Lau, Alexander Lemmens, Mickaël Montessinos. Lie algebras and the security of cryptosystems based on classical varieties in disguise. (Accepted at Eurocrypt 2026) [Eprint] [Code]
• Péter Kutas, Mickaël Montessinos. Efficient computations in central simple algebras using Amitsur cohomology. Journal of Algebra 665 (2025) pages 255-281. [Link] [Preprint] [Code]
• Mickaël Montessinos: Algebraic algorithms for vector bundles over curves. Journal of Algebra and Its Applications 25 - 5 (2026). [Link] [Preprint] [Code] [Documentation]

Doctoral Dissertation

I wrote my doctoral dissertation at Vilnius University under the supervision of Artūras Dubickas.
My dissertation is titled The Explicit Isomorphism Problem on Global Fields.

Selected Talks

• Problems related to the computation of the endomorphism ring for principally polarised superspecial abelian surfaces. Theoretical Science Visiting Program, OIST. January 2026. [Slides]
• The Splitting Problem in Central Simple Algebras. 19th Atelier PARI/GP 2024, ENS Lyon. January 2024. [Slides] [Code]
• The Explicit Isomorphism Problem. Arithmetic Geometry Seminar, Bayreuth University. January 2023. [Slides]