Joël Felderhoff

Joël Felderhoff is a Researcher in the Cryptography team at the Department of Informatics, King’s College London. His primary research focuses on algorithmic (classical and quantum) analysis of structured lattices and their cryptographic applications. Previously, he completed a PhD in the AriC team at ENS de Lyon under supervisors Damien Stehlé and Guillaume Hanrot, funded by the Direction Générale de l’Armement (Pôle de Recherche CYBER). His work bridges theoretical computer science and practical cryptographic security, addressing post-quantum challenges.

He has held teaching roles in computer science at Lyon 1 University and ENS de Lyon, including courses on cryptography, networks, and quantum computing. His academic journey includes research internships at CWI Amsterdam, INRIA Nancy, and the University of Copenhagen’s QMATH team, focusing on topics like lattice reduction, isogeny-based cryptography, and homological codes.

Key contributions include analyzing the hardness of structured lattice problems (e.g., Ideal-SVP) and their equivalence to cryptographic assumptions like NTRU. He actively participates in academic events, presenting at conferences such as TCC and ASIACRYPT, and contributes to open-source educational initiatives like MATh.en.JEANS and Prologin.