Print

Luca De Feo's curriculum vitæ
last update: September 4, 2016

born
sex: male
citizenship: Italian
Maître de Conférences en Informatique
Université de Versailles – Saint-Quentin
Équipe CRYPTO – Laboratoire LMV
bureau 309 B
45 Avenue des États-Unis
78035 Versailles Cedex, France

INRIA Saclay
Équipe-Projet GRACE
bureau 2046 – bât. Alan Turing
1 Rue Honoré d'Estienne d'Orves
91120 Palaiseau Cedex, France
tel: +33 1 39 25 40 35
fax: +33 1 39 25 40 57
email:
ORCiD: 0000-0002-9321-0773
twitter:
github: @defeo
pgp key: A60CD72B
www: http://defeo.lu/

Professional Experience

Education

2007–2010 École Polytechnique, PhD in Computer Science, Fast Algorithms for Towers of Finite Fields and Isogenies.
2004–2007 ENS Ulm (Paris), Diplôme de l’École Normale Supérieure, major Computer Science, minor Mathematics.
2005–2007 ENS Ulm (Paris), Master Parisien de Recherche en Informatique, grade: Bien.
2004–2005 ENS Ulm (Paris), Bachelor (licence) of Mathematics.
2001–2004 Università di Pisa, Bachelor (laurea triennale) of Computer Science, 110/110 cum laude.

Employment

Sep 2016 – Aug 2017 INRIA Saclay, Chercheur délégué (Invited researcher).
Dec 2015 – present Laboratoire de Mathématiques de Versailles, Université de Versailles Maître de Conférences (Assistant Professor).
Sep 2011 – Nov 2015 Laboratoire PRiSM, Université de Versailles Maître de Conférences (Assistant Professor).
Jul 2011 – Aug 2011 Combinatorics & Optimization, University of Waterloo Postdoctoral researcher.
Dec 2010 – May 2011 IRMAR, Université de Rennes 1 Postdoctoral researcher.

Research activity

Interests

Keywords: Algorithmic number theory, computer algebra, cryptology.

I research and develop algorithms for finite fields and algebraic curves, usually with applications to cryptology in mind. I tend to put the stress on efficient algorithms, both in the theoretical analysis and the software implementation.

I am interested in computer algebra systems and expressive programming languages for doing mathematics. I like to use SageMath in my investigations and am a member of the OpenDreamKit community, seeking to enhance the ecosystem of computational mathematics tools.

PhD supervision

2013–present
(defense exp. 2016)
Cyril Hugounenq: Réalisation d’algorithmes efficaces pour l’arithmétique des corps finis et des variétés abéliennes, avec applications à la cryptologie.

Master’s thesis supervision

2014 Ludovic Brieulle: Calcul d’isomorphismes de corps finis. M2 Algèbre Appliquée (UVSQ) (joint supervision with Jean-Pierre Flori (ANSSI) and Jérôme Plût (ANSSI)).
2014 Sébastien Besnier: Participation au développement d’un framework pour les courbes elliptiques en Sage. M2 Algèbre Appliquée (UVSQ).
2013 Cyril Hugounenq: Amélioration de l’algorithme de Couveignes pour le calcul d’isogénies. M2 Sécurité, Cryptologie et Codage de l’Information (UJF).

Grants and awards

2016–2017 Chercheur délégué, INRIA Saclay.
2015–2019 Horizon 2020 European Research Infrastructures WP, OpenDreamKit, http://opendreamkit.org/.
2015 ISSAC 2015 Best Poster Award for Deterministic Root Finding in Finite Fields.
2014–2016 Digiteo post-doctoral grant, Projet IdealCodes: Coppersmith’s Method for Coding Theory and Cryptography, http://idealcodes.github.io/.
2013–2016 Digiteo doctoral grant, Projet ARGC: Arithmetique Rapide pour la Géométrie et la Cryptologie.
2009 SIGSAM ISSAC 2009 Distinguished Student Author Award for Fast arithmetics in Artin-Schreier towers over Finite Fields.

Recent publications

Explicit isogenies in quadratic time in any characteristic with Cyril Hugounenq, Jérôme Plût and Éric Schost LMS Journal of Computation and Mathematics, 2016, 19 (A), pp. 267-282 10.1112/S146115701600036X

Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies with David Jao and Jérôme Plût Journal of Mathematical Cryptology, 2014, 8 (3), pp. 209-247 10.1515/jmc-2012-0015

Fast arithmetic for the algebraic closure of finite fields with Éric Schost and Javad Doliskani ISSAC ‘14, July 2014, Kobe, Japan. ACM, 2014, pp. 122-129 10.1145/2608628.2608672

Fast algorithms for ℓ-adic towers over finite fields with Éric Schost and Javad Doliskani ISSAC ‘13, June 2013, Boston (MA), USA. ACM, 2013, pp. 165-172 10.1145/2465506.2465956

Fast Arithmetics in Artin-Schreier Towers over Finite Fields with Éric Schost Journal of Symbolic Computation, 2012, 47 (7), pp. 771-792 10.1016/j.jsc.2011.12.008

Software

eLeMents
A DIY Learning Management System based on GitHub Pages.
Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
A sage script implementing the cryptosystem described in Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies.
FAAST
A library for Fast Arithmetic in Artin-Schreier Towers.
Transalpyne
A Python implementation of the Transposable Algebraic Language.

Academic responsibilities

Teaching

2013–present Université de Versailles, Lecturer in Mathematics (master’s)
2011–present Université de Versailles, Lecturer in Computer Science (bachelor, master’s)
2009–2010 Université Paris Diderot, Teaching assistant in Computer Science.
2007–2009 École Polytechnique, Teaching assistant in Computer Science.

Research administration

Other responsibilities

2016 Organisation of the C2 summer school.
2014 Organisation of the workshop CLIC 2014 (Codes, Lattices, Ideals, Cryptography).
2011–present Université de Versailles, organization of the Cryptology seminar.