Regular biography
Arjen Lenstra is a Professor Emeritus at the École Polytechnique Fédérale de Lausanne (EPFL), Department of Computer Science. His research includes number field sieve, lattice sieving, trial division, and the XTR public key system. He has supervised several PhD theses at EPFL, including those of Shahram Khazaei, Alexandre Karlov, Juraj Sarinay, Dag Arne Osvik, Joppe Willem Bos, Onur Özen, Andrea Miele, Maxime Augier, Alina Dudeanu, Benjamin Pierre Charles Wesolowski, and Dusan Kostic. He has also co-supervised theses of Novak Kaluderovic and Aymeric Genet.
Scholar-generated biography
Arjen Lenstra is a Professor of Computer Science at EPFL, specializing in computational number theory, integer factorization, and discrete logarithm. His research focuses on the mathematical foundations of cryptography and the development of algorithms for solving complex number-theoretic problems. Lenstra has made significant contributions to the field, including the factorization of large RSA moduli, the development of the number field sieve, and the creation of cryptographic systems such as XTR. His work has implications for both theoretical mathematics and practical cryptographic security, particularly in the context of breaking cryptographic protocols and improving key size selection.