Arjen Lenstra

from Wikipedia, the free encyclopedia

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

Arjen Lenstra

Life

Lenstra is the brother of mathematicians Jan Karel Lenstra and Hendrik Lenstra and studied at the University of Amsterdam , where he did his doctorate in 1984 under Peter van Emde Boas (" Polynomial Time Algorithms for the Factorization of Polynomials "). He was at the University of Chicago , Citibank in New York, the Technical University of Eindhoven and Lucent Technologies (the 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 XTR (a variant of the discrete logarithm ). He was significantly involved in the development and implementation of the number field sieve method for factorization , the fastest factoring method published to date with applications for attacks on RSA . In 1990 he and Mark S. Manasse succeeded in factoring the ninth Fermat number . With Manasse he also implemented various factoring methods at the end of the 1980s, such as the square sieve for distributed computing , which in 1994 succeeded in factoring a 129-digit number of the RSA challenge on the World Wide Web . For this purpose, he created the large integer software library LIP in C , which was popular at the time and is now obsolete , and which was expanded and maintained as freeLIP by Paul Leyland. With Henri Cohen , he implemented the APRCL primality test in 1987 (named after his brother Hendrik Lenstra, among others). In 1982, together with László Lovász and Hendrik Lenstra, he developed the LLL algorithm for the reduction of grid bases, which are preferably used in cryptography with integer number grids . Lenstra is also known for recommending the optimal key length in cryptographic systems.

Lenstra is a Fellow of the IACR (International Association for Cryptological Research). Since 2008 he has been a member of the Academia Europaea .

Fonts (selection)

Web links

Individual evidence

  1. Documentation from LIP (Postscript, English), Alex Perlis: Large Integer Computations, download
  2. Lenstra: Key length , Handbook of Information Security, 2004, PDF file ( Memento of the original from November 17, 2014 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. , improved version by Lenstra, Eric Verheul: Selecting cryptographic key sizes , Journal of Cryptology, Volume 14, 2001, pp. 255-293 @1@ 2Template: Webachiv / IABot / www.keylength.com
  3. ↑ Directory of members: Arjen K. Lenstra. Academia Europaea, accessed on August 10, 2017 .