Samuel S. Wagstaff Jr.: Difference between revisions
Content deleted Content added
Hmainsbot1 (talk | contribs) m AWB general fixes and delink dates per WP:DATELINK, WP:YEARLINK and MOS:UNLINKYEARS using AWB |
No edit summary |
||
| Line 15: | Line 15: | ||
}} |
}} |
||
'''Samuel Standfield Wagstaff, Jr.''' is an [[United States|American]] [[mathematician]] and [[computer scientist]]. born in 1945, whose research interests are in the areas of [[cryptography]], [[parallel computation]], and analysis of [[algorithm]]s, especially number theoretic algorithms. He is currently a professor of [[computer science]] and [[mathematics]] at [[Purdue University]]<ref name="pu_cs_wagstaff">[http://www.cs.purdue.edu/people/faculty/ssw/ Purdue University: Department of Computer Science: Faculty: Samuel Wagstaff, Jr.]</ref> who coordinates the [[Cunningham project]], a project to [[integer factorization|factor]] numbers of the form ''b''<sup>''n''</sup> ± 1, since 1983. He has authored/coauthored over 50 research papers and two books.<ref name="wagstaff_publication">[http://homes.cerias.purdue.edu/~ssw/pubs.html Selected Publications of Sam Wagstaff]</ref> |
'''Samuel Standfield Wagstaff, Jr.''' (born 21 February 1945) is an [[United States|American]] [[mathematician]] and [[computer scientist]]. born in 1945, whose research interests are in the areas of [[cryptography]], [[parallel computation]], and analysis of [[algorithm]]s, especially number theoretic algorithms. He is currently a professor of [[computer science]] and [[mathematics]] at [[Purdue University]]<ref name="pu_cs_wagstaff">[http://www.cs.purdue.edu/people/faculty/ssw/ Purdue University: Department of Computer Science: Faculty: Samuel Wagstaff, Jr.]</ref> who coordinates the [[Cunningham project]], a project to [[integer factorization|factor]] numbers of the form ''b''<sup>''n''</sup> ± 1, since 1983. He has authored/coauthored over 50 research papers and two books.<ref name="wagstaff_publication">[http://homes.cerias.purdue.edu/~ssw/pubs.html Selected Publications of Sam Wagstaff]</ref> |
||
Wagstaff received his [[Bachelor of Science]] in 1966 from [[Massachusetts Institute of Technology]]. His doctoral dissertation was titled, On Infinite Matroids, [[Ph.D.]] in 1970 from [[Cornell University]].<ref name="pu_cs_wagstaff" /><ref>{{MathGenealogy|id=4837}}</ref> |
Wagstaff received his [[Bachelor of Science]] in 1966 from [[Massachusetts Institute of Technology]]. His doctoral dissertation was titled, On Infinite Matroids, [[Ph.D.]] in 1970 from [[Cornell University]].<ref name="pu_cs_wagstaff" /><ref>{{MathGenealogy|id=4837}}</ref> |
||
| Line 22: | Line 22: | ||
Wagstaff was one of the founding faculty of [[Center for Education and Research in Information Assurance and Security]] ([[CERIAS]]) at Purdue, and its precursor, the Computer Operations, Audit, and Security Technology ([[COAST Laboratory|COAST]]) Laboratory. |
Wagstaff was one of the founding faculty of [[Center for Education and Research in Information Assurance and Security]] ([[CERIAS]]) at Purdue, and its precursor, the Computer Operations, Audit, and Security Technology ([[COAST Laboratory|COAST]]) Laboratory. |
||
==Selected publications== |
|||
* with [[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, 3rd edition 2002 as electronic book, [http://www.ams.org/online_bks/conm22 Online text] |
|||
* ''Cryptanalysis of number theoretic ciphers'', CRC Press 2002 |
|||
* with [[Carlos J. Moreno]]: ''Sums of Squares of Integers'', CRC Press 2005 |
|||
* [http://homes.cerias.purdue.edu/~ssw/cun1.pdf Wagstaff ''The Cunningham Project'', Fields Institute, pdf file] |
|||
==References== |
==References== |
||
Revision as of 11:28, 6 April 2014
Samuel S. Wagstaff, Jr. | |
|---|---|
| Born | 1945 (age 78–79) |
| Nationality |  United States |
| Alma mater | Cornell University and MIT |
| Known for | Wagstaff prime |
| Scientific career | |
| Fields | Mathematics Computer science |
| Institutions | Purdue University University of Georgia University of Rochester |
| Doctoral advisor | Oscar S. Rothaus |
| Doctoral students | Richard Sunseri William Speirs |
Samuel Standfield Wagstaff, Jr. (born 21 February 1945) is an American mathematician and computer scientist. born in 1945, whose research interests are in the areas of cryptography, parallel computation, and analysis of algorithms, especially number theoretic algorithms. He is currently a professor of computer science and mathematics at Purdue University[1] who coordinates the Cunningham project, a project to factor numbers of the form bn ± 1, since 1983. He has authored/coauthored over 50 research papers and two books.[2]
Wagstaff received his Bachelor of Science in 1966 from Massachusetts Institute of Technology. His doctoral dissertation was titled, On Infinite Matroids, Ph.D. in 1970 from Cornell University.[1][3]
In 1980 Wagstaff coauthored with Paul Erdős a paper entitled "The Fractional Parts of the Bernoulli Numbers" in the Illinois Journal of Mathematics, giving him an Erdős number of 1.
Wagstaff was one of the founding faculty of Center for Education and Research in Information Assurance and Security (CERIAS) at Purdue, and its precursor, the Computer Operations, Audit, and Security Technology (COAST) Laboratory.
Selected publications
- with 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, 3rd edition 2002 as electronic book, Online text
- 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