Samuel Wagstaff

Samuel Standfield Wagstaff junior (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 received his doctorate in 1970 from Cornell University with Oscar S. Rothaus ( On infinite Matroids ). He was a professor at the University of Rochester , the University of Illinois at Urbana-Champaign , the University of Georgia and has been a professor at Purdue University since 1983 . There he was one of the founding members of the Center for Education and Research in Information Assurance and Security (CERIAS). Among other things, he was visiting scholar at the Institute for Advanced Study .

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

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

A special type of primes was named after Samuel Wagstaff, the Wagstaff primes .

Fonts

with John Brillhart , Derrick Henry 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, 3rd edition 2002 as an electronic book, online edition
Cryptanalysis of number theoretic ciphers , CRC Press 2002
with Carlos J. Moreno : Sums of Squares of Integers , CRC Press 2005
Wagstaff The Cunningham Project , Fields Institute, PDF file
The joy of factoring, AMS, Student Mathematical Library 2013

Web links

Homepage

References

↑ Before that he was involved in its predecessor (until 1999) COAST (Computer operations, audit and security technology).
↑ Jeff Smith, Samuel Wagstaff: Methods of factoring large integers , in Number Theory, New York 1984/5 , Lecture Notes in Mathematics, Vol. 1240, Springer, 1987, p. 281, Jeff Smith, Samuel Wagstaff: How to crack an RSA Cryptosystem , Proceedings 14th Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida 1983
^ Robert Silverman, Samuel Wagstaff: A practical analysis of the elliptic curve factoring algorithm , Mathematics of Computation, Vol. 61, 1993, pp. 445-462
^ Website of the Cunningham project , named after Allan Cunningham, who published the first tables with Herbert Woodall in 1925.

personal data
SURNAME	Wagstaff, Samuel
ALTERNATIVE NAMES	Wagstaff, Samuel Standfield (full name)
BRIEF DESCRIPTION	American mathematician
DATE OF BIRTH	February 21, 1945
PLACE OF BIRTH	New Bedford , Massachusetts , Massachusetts

[1] Before that he was involved in its predecessor (until 1999) COAST (Computer operations, audit and security technology).

[2] Jeff Smith, Samuel Wagstaff: Methods of factoring large integers , in Number Theory, New York 1984/5 , Lecture Notes in Mathematics, Vol. 1240, Springer, 1987, p. 281, Jeff Smith, Samuel Wagstaff: How to crack an RSA Cryptosystem , Proceedings 14th Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida 1983

[3] Robert Silverman, Samuel Wagstaff: A practical analysis of the elliptic curve factoring algorithm , Mathematics of Computation, Vol. 61, 1993, pp. 445-462

[4] Website of the Cunningham project , named after Allan Cunningham, who published the first tables with Herbert Woodall in 1925.