Samuel S. Wagstaff, Jr.
Professor of Mathematics (courtesy)
Joined department: 1983
Before coming to Purdue, Professor Wagstaff taught at the Universities of Rochester, Illinois, and Georgia. He spent a year at the Institute for Advanced Study in Princeton. His research interests are in the areas of cryptography, parallel computation, and analysis of algorithms, especially number theoretic algorithms. He and J. W. Smith of the University of Georgia have built a special processor with parallel capability for factoring large integers. He is the author of Factorizations of bn ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, Contemporary Mathematics series, v. 22, Third edition, American Mathematical Society, 2002 (with John Brillhart, D. H. Lehmer, J. L. Selfridge and Bryant Tuckerman) (See http://www.ams.org/online_bks/conm22), Cryptanalysis of Number Theoretic Ciphers, CRC Press, 2002, Sums of Squares of Integers, CRC Press, 2005 (with Carlos Moreno), and The Joy of Factoring, American Mathematical Society, 2013. His Erdos number is 1.