Arjen Lenstra

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Arjen K. Lenstra at the Congress on Privacy & Surveillance (2013) of the École polytechnique fédérale de Lausanne (EPFL).

Arjen Klaas Lenstra (born March 2, 1956, Groningen) is a Dutch mathematician. He studied mathematics at the University of Amsterdam. He is currently a professor at the EPFL (Lausanne), in the Laboratory for Cryptologic Algorithms, and previously worked for Citibank and Bell Labs.

Lenstra is active in cryptography and computational number theory, especially in areas such as integer factorization. With Mark Manasse, he was the first to seek volunteers over the internet for a large scale scientific distributed computing project.[1] Such projects became more common after the Factorization of RSA-129 which was a high publicity distributed factoring success led by Lenstra along with Derek Atkins, Michael Graff and Paul Leyland. He was also a leader in the successful factorizations of several other RSA numbers.

Lenstra was also involved in the development of the number field sieve.[2] With coauthors, he showed the great potential of the algorithm early on by using it to factor the ninth Fermat number, which was far out of reach by other factoring algorithms of the time.[3] He has since been involved with several other number field sieve factorizations including the current record, RSA-768.

Lenstra's most widely cited scientific result is the first polynomial time algorithm to factor polynomials with rational coefficients in the seminal paper that introduced the LLL lattice reduction algorithm with Hendrik Willem Lenstra and László Lovász.[4]

Lenstra is also co-inventor of the XTR cryptosystem.

Lenstra's brother Hendrik Lenstra is a professor in mathematics at Leiden University and his brother Jan Karel Lenstra is a former director of Centrum Wiskunde & Informatica (CWI).

On 1 March 2005, Arjen Lenstra, Xiaoyun Wang, and Benne de Weger of Eindhoven University of Technology demonstrated[5] construction of two X.509 certificates with different public keys and the same MD5 hash, a demonstrably practical hash collision. The construction included private keys for both public keys.

Lenstra is the recipient of the Excellence in the Field of Mathematics RSA Conference 2008 Award.[6]

See also[edit]

References[edit]

  1. ^ Arjen K. Lenstra and Mark S. Manasse. "Factoring by electronic mail", in Proceedings of Eurocrypt '89, Lecture Notes in Computer Science, Volume 434, pp. 355-371, 1990.
  2. ^ A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard, “The Number Field Sieve,” in A. K. Lenstra and H. W. Lenstra, Jr. (eds.) The Development of the Number Field Sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, New York, pp. 11–42, 1993.
  3. ^ A. K. Lenstra, H. W. Lenstra, Jr., M. S. Menasse, and J. M. Pollard, “The Factorization of the Ninth Fermat Number,” Math. Comp. 61, 319–349, 1993.
  4. ^ A.K. Lenstra, H.W. Lenstra, Jr., and L. Lovász, "Factoring polynomials with rational coefficients". Mathematische Annalen 261 (4): pp. 515–534, 1982.
  5. ^ Cryptology ePrint Archive
  6. ^ RSA Conference Awards

External links[edit]