Arjen Lenstra

Arjen Lenstra Klaas ( born March 2, 1956 in Groningen) is a Dutch mathematician.

Life

Lenstra is the brother of the mathematician Hendrik Lenstra and Lenstra January Karel and studied at the University of Amsterdam, where in 1984 he received his doctorate from Peter van Emde Boas ( " Polynomial Time Algorithms for the Factorization of Polynomials "). He was at the University of Chicago, at Citibank in New York, Eindhoven University of Technology and Lucent Technologies (former Bell Labs) and is currently a professor at the École Polytechnique Fédérale de Lausanne ( EPFL).

Lenstra is particularly concerned with cryptography, for example, public-key cryptography methods such as the XTR ( a variant of the discrete logarithm ). He was instrumental in the development and implementation of the number field sieve method for factoring, the fastest previously published factorization with applications to attacks on RSA. Thus he succeeded with Mark S. Manasse 1990, the factorization of the ninth Fermat number. With Manasseh, he implemented the late 1980s, various factorization as the quadratic sieve for distributed computing, so in 1994 the World Wide Web succeeded factoring a 129- digit number RSA -Challenge. To this end, he created the popular at the time, today overtook Large integer LIP software library in C, which was extended as freeLIP by Paul Leyland and maintained. With Henri Cohen, he implemented the 1987 APRCL primality test (named, among others, according to his brother Hendrik Lenstra ). With László Lovász and Hendrik Lenstra 1982, he developed the LLL algorithm for the reduction of lattice bases that are used in cryptography preferably with integer number grids application. Lenstra is also known for recommendations of optimal key length in cryptographic systems.

Lenstra is a Fellow of IACR (International Association for Crypto Logical Research).

Works

• HW Lenstra (eds.): The development of the number field sieve. Lecture Notes in Mathematics 1554, Springer 1993, ISBN 3-540-57013-6.