
Hendrik Lenstra
Dutch mathematician specializing in computational number theory, known for the elliptic curve factorization method · 1949
- Born
- April 16, 1949
- Country
- Kingdom of the Netherlands
- Section
- Mathematics
Biography
Hendrik Willem Lenstra Jr. (born 16 April 1949 in Zaandam) is a Dutch mathematician who works in number theory. His research on computational methods has produced algorithms that remain in use for factoring large numbers and for solving problems involving lattices and integer equations. He is one of the most influential figures in computational mathematics since the late twentieth century.
Lenstra was born in Zaandam, a town in the Netherlands, in 1949. He earned his doctorate at the University of Amsterdam in 1977 and became a professor there the following year. Mathematics runs strongly in his family: three of his brothers, Arjen, Andries and Jan Karel, are also mathematicians. Jan Karel later directed the Centrum Wiskunde & Informatica (CWI), the Dutch national centre for mathematics and computer science.
In 1987 he joined the faculty of the University of California, Berkeley. From 1998 he split his time between Berkeley and Leiden University, and in 2003 he left Berkeley to take a full-time post at Leiden. His international standing grew steadily; in 2010 he chaired the programme committee of the International Congress of Mathematicians, the field's largest gathering.
His work deals with problems where whole numbers have a deep internal structure. One of his best-known results is the LLL algorithm, which he co-discovered in 1982 with Arjen Lenstra and László Lovász. The method works with lattices, regular arrangements of points in space, and finds short, manageable bases for them. It proved useful in cryptography and in solving equations, since many hard problems can be restated in terms of lattices.
In 1983 he developed a polynomial-time algorithm for integer programming problems when the number of variables is fixed. A polynomial-time algorithm is one whose running cost grows at a moderate rate as the problem gets larger. This work earned him the Fulkerson Prize in 1985.
His most widely known contribution is the elliptic curve factorization method, discovered in 1987. To split a large number into prime factors, the method explores points on an elliptic curve, a family of curves defined by cubic equations, using modular arithmetic. When the number has a small factor, the method tends to find it efficiently, and it became a practical tool in cryptography. He also worked on primality tests, which check whether a number is prime without having to factor it.
In 1992 he computed all solutions of the so-called inverse Fermat equation, a classical problem about powers of natural numbers. With Peter Stevenhagen he also studied Artin reciprocity, Mersenne primes and the Chebotarev density theorem. His Cohen-Lenstra heuristics, developed with Henri Cohen, are precise conjectures about how class groups of ideals in quadratic fields are distributed. Class groups are algebraic structures that measure how far certain number systems fall short of unique factorization. Although they remain conjectures, they continue to guide research.
His honours include membership of the Royal Netherlands Academy of Arts and Sciences from 1984, the Spinoza Prize in 1998, appointment as Knight of the Order of the Netherlands Lion in 2009, a Gauss Lecture for the German Mathematical Society in 2009, and fellowship of the American Mathematical Society in 2012.
Lenstra's legacy lies in his algorithms, which form part of the toolkit of computational number theory, and in the conjectures that shape work on class groups. Many of his methods are now taught as examples of how an abstract problem can become practical.
Main contributions
- 1982LLL algorithm: co-discovered with Arjen Lenstra and László Lovász, it finds short bases for lattices of points.
- 1983Polynomial-time algorithm for integer programming when the number of variables is fixed.
- 1987Elliptic curve factorization method, which breaks large numbers into factors using points on these curves.
- 1992Computation of all solutions to the inverse Fermat equation.
- Cohen-Lenstra heuristics: conjectures about the structure of class groups of ideals in quadratic fields.
Teachers and students
Studied under:
Taught:
Trivia and anecdotes
A family of mathematicians
Three of his brothers, Arjen, Andries and Jan Karel, are also mathematicians, and Jan Karel later directed the Dutch CWI.
Their contemporaries
While Hendrik Lenstra was alive (1949–)…
Alive at the same time
Discovered or invented in those years
- 1957Artificial satelliteAn artificial satellite is a human-made object placed in orbit around a celestial body, usually Earth, to collect information, relay signals, or carry out a specific task.
- 1969InternetA global network of interconnected computer networks that communicate using the TCP/IP protocol suite.
- 1971EmailA network service that lets users send and receive digital messages through addressed mailboxes, much like postal mail but electronic.
- 1973Mobile phoneA handheld wireless phone that lets people make and receive calls while moving across a cellular network area.
- 1989World Wide WebA system of linked documents and resources, connected by hyperlinks and accessed over the Internet with web browsers.
- 1990Web browserA program that lets people access the web by fetching a page's files from a server and displaying them on screen as an interactive page.
Andrew Wiles1953 · Mathematics
Vladimir Arnold1937–2010 · Mathematics
Robert Aumann1930 · Mathematics
Alexander Grothendieck1928–2014 · Mathematics
John Tate1925–2019 · Mathematics
Benoit Mandelbrot1924–2010 · Mathematics