Samuel S. Wagstaff, Jr.
Samuel S. Wagstaff, Jr.
Professor of Computer Science
Professor of Mathematics (courtesy)

Joined department in 1983

Education:
BS, Massachusetts Institute of Technology (1966)
PhD, Cornell University (1970)

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, and Sums of Squares of Integers, CRC Press, 2005 (with Carlos Moreno).

Selected Publications
J. Gower and S. S. Wagstaff Jr, "Square form factorization", Math. Comp., v. 77 (2008), pages. 551-588.
S. S. Wagstaff Jr, "Congruences for r_s(n) modulo 2s", Journal of Number Theory, v. 127 (2007), pages 326-329.
S. S. Wagstaff Jr, "Is there a shortage of primes for cryptography?", International Journal of Network Security, v. 3 (2006), pages 296-299.
Last Updated: March 16, 2008 02:46pm
Contact Information

Office: LWSN 1167
Phone: 49-46022

Send Mail My Homepage