Nagle Lecture Series
1997 Fall Nagle Lecture
Arjen Lenstra
Securing the Net: the Fruits of Incompetence
October 23, 1997
Description of the Talk
Only a fraction of Internet security breaches are publicized. In this talk I will show how elementary mathematical tools should improve network security and how their effectiveness is mostly based on our incompetence.
Description of the Speaker
After Arjen K. Lenstra got his Ph.D. from the University of Amsterdam, he was a visiting professor at the University of Chicago, while consulting for IBM, AT&T Bell Labs, and DEC SRC. In 1989, he joined the Mathematics and Cryptography research group at Bellcore, and later moved to the Corporate Technology Office of Citibank.
His major research interest is Computational Number Theory, in particular algorithms for factoring integers and computing discrete logarithms. He developed a portable toolkit for experimenting with cryptographic protocols; this software was used in 1994 to break the famous 1977 RSA-Challenge number. He is one of the co-developers of the recent number field sieve factoring algorithm.
The Organizing Committee of the NLS consists of Ed Saff (Chair), Ken Pothoven, Ralph Oberste-Vorth, Arun Mukherjea, and Greg McColm.