Arjen Klaas Lenstra

March 2, 1956

Groningen, Netherlands

He is currently a professor at the École Polytechnique Fédérale de Lausanne (Lausanne), in the Laboratory for Cryptologic Algorithms, and previously worked for Citibank and Bell laboratories 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 Such projects became more common after the Factorization of Republic of South Africa -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 Republic of South Africa numbers. Lenstra was also involved in the development of the number field sieve. 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. He has since been involved with several other number field sieve factorizations including the current record, Republic of South Africa -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. Lenstra is also co-inventor of the XTR cryptosystem. On 1 March 2005, Arjen Lenstra, Xiaoyun Wang, and Benne de Weger of Eindhoven University of Technology demonstrated 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 Republic of South Africa Conference 2008 Award.

Arjen Klaas Lenstra Edit Profile

mathematician university professor

Education

He studied mathematics at the University of Amsterdam.

Career

He is currently a professor at the École Polytechnique Fédérale de Lausanne (Lausanne), in the Laboratory for Cryptologic Algorithms, and previously worked for Citibank and Bell laboratories 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

Such projects became more common after the Factorization of Republic of South Africa -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 Republic of South Africa numbers. Lenstra was also involved in the development of the number field sieve.

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. He has since been involved with several other number field sieve factorizations including the current record, Republic of South Africa -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.

Lenstra is also co-inventor of the XTR cryptosystem. On 1 March 2005, Arjen Lenstra, Xiaoyun Wang, and Benne de Weger of Eindhoven University of Technology demonstrated 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 Republic of South Africa Conference 2008 Award.

Main Photo