Hendrik Lenstra

Hendrik Willem Lenstra Junior ( * April 16, 1949 in Zaandam, Netherlands) is a Dutch mathematician who deals with number theory.

Lenstra in 1977 at the University of Amsterdam PhD at Frans Oort with a thesis on number fields with Euclidean algorithm ( Euclidean number fields ). In 1978 he became a professor, which he remained until 1986. Since 1987 to 2003 he was at the University of California, Berkeley. From 1998 to 2003 he held the same lectures in Leiden and Berkeley. After that, he was only in suffering. He has been a visiting scientist at the Institute for Advanced Study (1990/ 91) and 2000/2001 Hewlett -Packard Visiting Professor at MSRI.

Lenstra is known for various number-theoretic algorithms. He is the discoverer of the Elliptic Curve Factorization ( a factorization using the arithmetic of elliptic curves, 1987) and improved and implemented in 1984 with Henri Cohen the APRCL primality test ( after the initials of the developer ) by Leonard Adleman, Carl Pomerance, and Robert Rumely 1983, of primes used as the first test referred to in the public-key cryptography ( RSA) of a hundred or more bits in length ( used today 500 to 2000 -bit primes ) was efficiently applicable. In 1982 he developed with his brother Arjen Lenstra and László Lovász, the LLL algorithm for reduction of a base of grids, also with applications for example in cryptography. He was also involved in a project for the math behind the paintings of MC Escher. Lenstra suggested the Internet Project ABC @ Home, which launched in January 2007 and collect data for an empirical investigation of the ABC conjecture in which thousands of volunteers on underutilized computers. He has the proof of this conjecture as a goal.

The Cohen- Lenstra heuristics includes assumptions about the structure of the class groups of quadratic number fields. These were derived from extensive computer calculations and confirmed numerically by them.

In 1985 he was awarded the Fulkerson Prize for the work Integer programming with a fixed number of variables. In 1998 he was awarded the Spinoza Prize from the Netherlands Organization for Scientific Research ( NWO). In 1986 he was invited speaker at the International Congress of Mathematicians (International Congress of Mathematicians ICM) in Berkeley (Elliptic curves and number theoretic algorithms ). In 2000 he gave a plenary lecture at the 3rd European Congress of Mathematicians in Barcelona ( Flags and lattice base reduction). In 2003 he was invited by the Australian Mathematical Society as Mahler Lecturer.

In 2007 he was awarded an Academy Professorship of the Royal Netherlands Academy of Sciences ( KNAW ), which allows him for five years exclusive research and professional development. Two years later he was appointed Knight of the Order of the Netherlands Lion. Since 1984 he is member of the KNAW and since 1996, the American Academy of Arts and Sciences.

In 2009 he held the Gaussian lecture the DMV. The IMU appointed him chairman of the program committee for the preparation of the ICM 2010 in Hyderabad. He is a Fellow of the American Mathematical Society.

His doctoral include Daniel Bernstein, Preda Mihăilescu, René Schoof, Peter Steve Hagen and William A. Stein.

The IMDb lists two documentaries about Lenstra. His brothers Arjen Lenstra Klaas and Jan Karel Lenstra (Director of CWI ) are also well-known mathematician.

Writings

  • Euclidean Number Fields. Parts 1-3, Mathematical Intelligencer 1980
  • Factoring integers with elliptic curves. Annals of Mathematics, Volume 126, 1987, p 649-673
  • With A. K. Lenstra: Algorithms in Number Theory. Pp. 673-716, In Jan van Leeuwen (Ed.): Handbook of Theoretical Computer Science, Vol A: Algorithms and Complexity. Elsevier and MIT Press 1990, ISBN 0-444-88071-2, ISBN 0-262-22038-5.
  • Algorithms in Algebraic Number Theory. Bulletin of the AMS, Volume 26, 1992, pp. 211-244.
  • Primality testing algorithms. Séminaire Bourbaki 1981.
  • With Steve Hagen: Artin reciprocity and Mersenne Primes. Nieuw Archief for Maths 2000.
  • With Steve Hagen: Chebotarev density theorem and his. Mathematical Intelligencer 1992 ( online on his website ).
  • Prof Destinite Fibonacci Numbers, December 2005, PDF file, English
385186
de