logo epfl
Ecole Polytechnique Fédérale de Lausanne
français | english
 EPFL > people@EPFL > Arjen Lenstra login

Full Professor
Laboratory for cryptologic algorithms
Full Professor
SSC - Teaching
Arjen Lenstra
Professor
PhD (University of Amsterdam, 1984)
nationality: Dutch
web site: http://lacal.epfl.ch

office(s): INJ330
phone(s): [+41 21 69] 38101,31312
Contact
BIOGRAPHY
Education
    Arjen Lenstra got his PhD in mathematics and computer science from the Universiteit van Amsterdam, The Netherlands, in 1984.

Employment history
    From 1984 until 2006 Arjen Lenstra worked in the USA: until 1989 as visiting professor at the department of computer science of The University of Chicago in Chicago, IL, with summer stints at IBM Thomas J. Watson Research Center (1985), Yorktown Heights, NY, AT&T Bell Laboratories (1986), Murray Hill, NJ, and Digital Equipment Corporation Systems Research Center (1987, 1988, 1989), Palo Alto, CA; until 1996 as senior scientist at the mathematics and cryptology research group of Bell Communications Research (Bellcore) in Morristown, NJ; until 2004 as vice-president of emerging technologies of Citigroup in New York City, NY, first at the corporate technology office, then from 2002 at Citigroup's corporate information security office; until 2006 as distinguished member of technical staff at the computing sciences center of Alcatel-Lucent Bell Laboratories in Murray Hill, NJ. From 2000 to 2006 he was part-time professor of cryptology at the Technical University Eindhoven. In January 2006 he became full professor at the school of computer & communication sciences (I&C) of EPFL, Lausanne, Switzerland, where he heads the laboratory for cryptologic algorithms (LACAL).

Research interests
    Computational and implementation aspects and design of cryptologic methods and the impact of mass market electronic devices such as PlayStation 3 game consoles on security assessments of cryptographic methods.

Past research

Honors and services

Funding
    Research funded by the Swiss National Science Foundation, Microsoft, the European Commission, Sony Switzerland, Sun Microsystems, and the Australian Research Council.
Recent papers
Efficient SIMD arithmetic modulo a Mersenne number
Factorization of a 768-bit RSA modulus
Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate

links to other papers
Courses and student projects
Discrete structures, spring 2012
Advanced topics in cryptology, fall 2011
Algorithms in public key cryptology, fall 2012

Student projects
Links
Botanical art pictures
Laboratory for cryptologic algorithms
Teaching
Communication Systems

Phd programs
Phd Students
Augier Maxime
Bos Joppe Willem Thesis details
Dudeanu Alina
Miele Andrea
Mir Jalili Seyyd Hasan
Osvik Dag Arne Thesis details
Özen Onur Thesis details

Past Phd students:
Karlov Alexandre Thesis details
Khazaei Shahram Thesis details
Sarinay Juraj Thesis details
Researchers
Dimitar Jetchev
Thorsten Kleinjung
Past researchers
Nicolas Gama
Marcelo Kaihara
Martijn Stam
Secretariat
Monique Amhof
Building BC101
Station 14
CH-1015 Lausanne

Tel. + 41 21 693 1312
monique.amhof@epfl.ch


©2004-2012 Arjen Lenstra - EPFL, 1015 Lausanne - last updated : 2011-10-18 17:46:10
The owner of this page is fully responsible for its contents