Home

Personal information

I am a full-time researcher at Inria Rennes within the CAPSULE team. I work in cryptology, with a focus on symmetric cryptanalysis, quantum algorithms and post-quantum cryptography.

Previously I was a postdoctoral researcher at the CWI in Amsterdam, in the Cryptology Group where I worked with Marc Stevens. I completed my PhD thesis in 2021 in Inria Paris, in the team SECRET (now COSMIQ). My thesis advisor was María Naya-Plasencia and my co-advisor André Chailloux.

Research

Post-quantum cryptography aims at protecting current cryptosystems from an attacker equipped with a large-scale quantum computing device. While such a machine does not exist yet, it is well known that it would be able to break some widely used public-key cryptosystems (for example RSA). This is why the community is designing post-quantum cryptosystems which would be immune to this threat.

The confidence we have in modern cryptosystems relies on a large-scale cryptanalysis effort: cryptanalysts try for years to find weaknesses in designs or improved algorithms for the mathematical problems that underlie their security assumptions. Because of the possibility that a functional quantum computer appears in the future, we need to look not only for classical attacks but also quantum attacks, which make inherent use of the enhanced computational power of such a machine. While the attacker has quantum power, the algorithms attacked are still classical, because we expect them to still be in use twenty or thirty years from now.

This is the area of quantum cryptanalysis , on which my research mainly focuses:

• In symmetric (secret-key) cryptography: symmetric cryptosystems such as block ciphers, hash functions, MACs, are commonly admitted to be generally robust against a quantum attacker. While this is true of most designs and in most use cases, many recent works have designed improvements and attacks specific to the quantum setting. My work in this area consists in finding such attacks and establishing more precise estimates of post-quantum security for current symmetric cryptosystems.
• In asymmetric (public-key) cryptography: public-key cryptosystems, whether pre- or post-quantum, rely on the hardness of well-formulated mathematical problems such as factoring or finding short vectors in lattices. I work on improving the quantum algorithms which target these problems.

Projects

• PEPR Cybersécurité - Projet Cryptanalyse [link]
• PEPR Quantique - Projet PQ-TLS [link]

Students

• Aurel Pichollet-Mugnier, from november 2024 to october 2027, with Patrick Derbez and Zoé Amblard (Thales SIX)
• Quentin Edme, from january 2024 to january 2027, with Pierre-Alain Fouque and Loïc Ferreira (Orange Labs), on proofs of security and attacks on symmetric designs in the quantum setting
• Mathieu Degré, from january 2024 to january 2027, with Patrick Derbez, on automatic tools for symmetric cryptanalysis and meet-in-the-middle attacks

• Jules Rousseau (University of Rennes), from april 2024 to september 2024, with Patrick Derbez: Cube-based cryptanalysis of Ascon and Gift
• Aurel Pichollet-Mugnier (University of Bordeaux), from march 2024 to september 2024, with Zoé Amblard & Nicolas David: Optimized Quantum Circuit of Ascon
• Thibault Didier (INSA Rennes) from june 2024 to july 2024: Optimisation d’un circuit multi-somme réversible pour la factorisation quantique
• Lucie Lahaye (ENS Lyon) from june 2023 to july 2023: Attaques algébriques sur la fonction de hachage Ascon

Program commitee(s)

• Inscrypt 2024 [link]
• CRYPTO 2024 artifact evaluation [link]
• CRYPTO 2024 [link]
• EUROCRYPT 2024 [link]
• CRYPTO 2023 [link]
• Editorial Board of ToSC [link] for the year 2022/2023 and 2023/2024.

Awards

• Prix de thèse du GDR sécurité informatique 2022 [link]
• ASIACRYPT 2021 "Best Paper Award"

Contact

andre /dot/ schrottenloher /at/ inria /dot/ fr

By Randall Munroe on xkcd.com