CERIAS Fellow
Office Phone
(765) 494-6022
Education
B.S. from M.I.T. and Ph.D. from Cornell University
Prior Appointments
Taught at the Universities of Rochester, Illinois, and Georgia
Research Areas
Cryptography, Parallel Computation, and Analysis of Algorithms, Number Theoretic Algorithms.
Key Areas
Cryptology and Rights Management
Notable Experience
Spent one year at the Institute for Advanced Study in Princeton. Built a special processor with parallel capability for factoring large integers (with J.W. Smith of the University of Georgia).
Publications
Author of Factorizations of bn ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, Contemporary Mathematics, 22, American Mathematical Society, Providence (1983) (second edition 1988), (with John Brillhart, D. H. Lehmer, J. L. Selfridge, and Bryant Tuckerman), Cryptanalysis of Number Theoretic Ciphers, Computational Mathematics Series, Chapman & Hall/CRC Press (2003).
Biography
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, 22, American Mathematical Society, Providence (1983) (second edition 1988), (with John Brillhart, D. H. Lehmer, J. L. Selfridge, and Bryant Tuckerman).
