Luca De Feo

Maître de Conférences - Équipe CRYPTO

Laboratoire PRiSM
Université de Versailles
45 Avenue des États-Unis
78035 Versailles Cedex, France

Tel: +33 1 39 25 40 17
Fax: +33 1 39 25 40 57
E-mail: first.last-name
					arobase uvsq.fr
my pgp key
Luca De Feo

Research

Research interests: Algorithmic Number Theory, Computer Algebra, Cryptology, Automated deduction.

In École Polytechnique, I used to organise the computer algebra seminar Cal4doc.

My publications

My list of publications is available on the HAL server.

Software

I maintain the following softwares:

Teaching

Past courses

2009-2010
TA (Moniteur) for the course IO2, Internet and Tools, in the L1 (Bachelor) in Computer Science of Paris VII.
2008-2009
TA for the course INF568, Cryptology, in the Masters in Computer Science of École Polytechnique ;
TA for Modex Web, in the second year of École Polytechnique.
2007-2008
TA for the course INF311, Introduction to Computer Science, in the common semester of École Polytechnique.

Selected talks

Duality, transposition principle and automatic transposition of code
(slides) On the transposition of computer programs. PLMMS, CNAM, Paris, France, July 2010.
(slides) On the transposition of computer programs. COSEC Oberseminar, b-it, Bonn, Germany, June 2010.
(slides) Dualities and Transposition principle. Séminaire de Théorie des nombres, Université Paul Sabatier, Toulouse, France, June 2009.
Computing explicit isogenies
(slides) Calcul rapide d’isogénies en genre 1. Séminaire de Cryptologie, Université de Caen, Caen, France, October 2010.
(slides) Isogeny computation in small characteristics. Séminaire CARAMEL, LORIA, Nancy, Francia, March 2010.
(slides) Isogeny computation in small characteristics. ECC, University of Calgary, Calgary, Canada, August 2009.
(slides) Computing isogenies of elliptic curves in small characteristics. Journées Arithmétiques, Univestité Jean Monnet, Saint-Étienne, France, July 2009.
Fast Arithmetics for Artin-Schreier towers
(slides) Beyond fast multiplication in GF(p)-bar. SCG, University of Waterloo, Canada, August 2011.
(slides) Fast arithmetics in Artin-Schreier towers over finite fields. RAIM, ENS, Lyon, France, October 2009.
(slides) Fast arithmetics in Artin-Schreier towers over finite fields. ISSAC, KIAS, Seoul, Korea, July 2009.
Other subjects
(slides) Fast algorithms: from type theory to number theory. Séminaire Algorithms, INRIA Rocquencourt, France, October 2010.
(slides) Elliptic Curve Cryptography. Seminario d'Informatica, Università di Pisa, Italy, June 2007.