Samuel S. Wagstaff, Jr.

Samuel Standfield Wagstaff Jr. ( born February 21, 1945 in New Bedford, Massachusetts) is an American mathematician who deals with algorithmic number theory and cryptography.

Wagstaff studied at the Massachusetts Institute of Technology (Bachelor 1966) and his PhD in 1970 from Cornell University with Oscar S. Rothaus (On infinite matroid ). He was a professor at the University of Rochester, the University of Illinois at Urbana- Champaign, the University of Georgia and is since 1983 professor at Purdue University. There he was one of the founding members of the Center for Education and Research in Information Assurance and Security ( CERIAS ). He has been a visiting scientist at the Institute for Advanced Study.

He dealt with the analysis of algorithms (especially number theoretic algorithms), cryptography and parallel computing. By Jeff Smith, he built in the 1980s, a special-purpose computer for the factorization (using the then favored continued fraction method), the "Georgia Cracker ". With Robert Silverman 1993, he examined algorithms for elliptic curve factorization (originally conceived by Hendrik Lenstra ).

Since 1983 he has coordinated the " Cunningham Project", the tables of the factorization of numbers of the form b ⁿ ± 1 created (of which the Mersenne numbers and Fermat numbers are special cases ).

Writings

  • John Brillhart, Derrick Lehmer, John L. Selfridge, Bryant Tuckerman: Factorization of b ⁿ ± 1, b = 2,3,5,6,7,10,11,12 up to high powers, American Mathematical Society, 1983, 3. Edition 2002 as an electronic book, online edition
  • Cryptanalysis of number theoretic ciphers, CRC Press 2002
  • Carlos J. Moreno: Sums of Squares of Integers, CRC Press 2005
  • Wagstaff The Cunningham Project, Fields Institute, pdf file
New Bedford (Massachusetts) Computational number theory John Selfridge Integrated Authority File
704824
de