Samuel S. Wagstaff Jr. | Academic Influence

Samuel S. Wagstaff Jr.'s AcademicInfluence.com Rankings

Samuel S. Wagstaff Jr.

Mathematics

#5305

World Rank

#7476

Historical Rank

#1760

USA Rank

Measure Theory

#3959

World Rank

#4667

Historical Rank

#1132

USA Rank

mathematics Degrees

Download Badge

Mathematics

Samuel S. Wagstaff Jr.'s Degrees

PhD Mathematics University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Samuel S. Wagstaff Jr. Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Samuel Standfield Wagstaff Jr. is an American mathematician and computer scientist, 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 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 four books. He has an Erdős number of 1.

(See a Problem?)

Samuel S. Wagstaff Jr.'s Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Factorizations of b[n]±1, b=2, 3, 5, 6, 7, 10, 11, 12 up to high powers (1985) (147)
The pseudoprimes to 25⋅10⁹ (1980) (121)
An Efficient Time-Bound Hierarchical Key Management Scheme for Secure Broadcasting (2008) (92)
The irregular primes to 125000 (1978) (88)
Divisors of Mersenne numbers (1983) (71)
Book Review: Proceedings of the Third International Conference on Spectral and High Order Methods@@@Book Review: An introduction to computational geometry for curves and surfaces@@@Book Review: The mathematics of surfaces@@@Book Review: Algorithmic number theory, Volume I: Efficient algorithms (1998) (59)
Greatest of the least primes in arithmetic progressions having a given modulus (1979) (56)
Pseudoprimes and a generalization of Artin's conjecture (1982) (53)
A practical analysis of the elliptic curve factoring algorithm (1993) (45)
Sums of Squares of Integers (2005) (43)
Cryptanalysis of Number Theoretic Ciphers (2002) (39)
New congruences for the Bernoulli numbers (1987) (27)
The Joy of Factoring (2013) (24)
The Cunningham Project (22)
The new mersenne conjecture (1989) (21)
Watermarking with quadratic residues (1999) (18)
MPQS with Three Large Primes (2002) (16)
Aurifeuillian factorizations and the period of the Bell numbers modulo a prime (1996) (16)
Square form factorization (2008) (13)
Low-threat security patches and tools (1997) (13)
Some numerical results on Fekete polynomials (1975) (12)
On k -Free Sequences of Integers (1972) (11)
Zeros of p-Adic L-Functions, II (1975) (10)
The Schnirelmann density of the sums of three squares (1975) (9)
New bound for the first case of Fermat’s last theorem (1989) (9)
Prime Numbers with a Fixed Number of One Bits or Zero Bits in Their Binary Representation (2001) (9)
Some Questions about Arithmetic Progressions (1979) (9)
The period of the Bell numbers modulo a prime (2010) (8)
Methods of factoring large integers (1987) (8)
Zeros of -adic -functions (1975) (8)
Minimal Art : A Critical Anthology (1968) (7)
New Ideas for Factoring Large Integers (1983) (7)
48 more solutions of Martin Davis's quaternary quartic equation (1995) (7)
The fractional parts of the bernoulli numbers (1980) (7)
Representation of Numbers as Sums of Squares (2005) (5)
Solution of Nathanson’s exponential congruence (1979) (5)
Sequences not containing an infinite arithmetic progression (1972) (5)
ITERATING THE PRODUCT OF SHIFTED DIGITS (2010) (5)
Additive h-bases for n (1979) (5)
On sequences of integers with no 4, or no 5 numbers in arithmetical progression (1967) (5)
Dynamic Cryptographic Hash Functions (2006) (4)
The number field sieve on many computers (1999) (4)
Computing Discrete Logarithms (2019) (4)
Strengthening the Baillie-PSW primality test (2020) (4)
Congruences for rs(n) modulo 2s (2007) (3)
$p$-divisibility of certain sets of Bernoulli numbers (1980) (2)
Provable Partial Key Escrow (2010) (2)
Direct Attacks (2019) (2)
The Editor's Corner: The New Mersenne Conjecture (1989) (2)
The least prime in an arithmetic progression with prime difference. (1978) (1)
Cognitive Processing of Cryptography Concepts: An fMRI Study (2017) (1)
The Search for Aurifeuillian-Like Factorizations (2012) (1)
Review: Paulo Ribenboim, The book of prime number records (1989) (1)
Complete Systems (2019) (1)
Private Key Ciphers (2019) (0)
Signature Algorithms (2019) (0)
Update 2.2 to the Second Edition (1988) (0)
Information Theory (2019) (0)
A simple protocol for digital cash by elliptic curves (2004) (0)
Exponential Methods of Factoring Integers (2019) (0)
Computers and Prime Factorization (1989) (0)
Public Key Ciphers (2019) (0)
Divisibility and Arithmetic (2019) (0)
Congruences for r s ( n ) Modulo 2 s (0)
Euler’s Theorem and Its Consequences (2019) (0)
V. How to Use the Main Tables (1988) (0)
Probability Theory (2019) (0)
THE FRACTIONAL PARTS OF THE BERNOULLI NUMBERS BY PAUL ERD 6 S AND (1980) (0)
Exploiting an Error (2019) (0)
The denominators of the Bernoulli numbers (2021) (0)
II. Convenient Short Tables (1988) (0)
VII. Introduction to the Appendices (1988) (0)
PRIMARY CARMICHAEL NUMBERS (2022) (0)
Image steganography using sudoku (2013) (0)
Number theory relevant to factoring (2013) (0)
A Tradition of Patronage: Daniel Wadsworth and his Successors (1968) (0)
Why factor integers (2013) (0)
Table of All Carmichael Numbers < 25 ⋅10 9 . (1990) (0)
Finding Large Primes (2019) (0)
How are factors used (2013) (0)
Some uses of microcomputers in number theory research (1990) (0)
Appendix. Answers and hints for exercises (2013) (0)
Is There a Shortage of Primes for Cryptography? (2006) (0)
Complicated Protocols (2019) (0)
Active Attacks (2019) (0)
Second Degree Congruences (2019) (0)
Groups, Rings and Fields (2019) (0)
Primes (2019) (0)
Entropy of crowds-like anonymizer networks (2003) (0)
Random Number Generation (2019) (0)
Congruences (2019) (0)
Key Exchange Algorithms (2019) (0)
#A16 INTEGERS 12A (2012): John Selfridge Memorial Issue THE SEARCH FOR AURIFEUILLIAN-LIKE FACTORIZATIONS (2012) (0)
FFT-ECM by division polynomials for factoring (2004) (0)
III. Introduction to the Main Tables (1988) (0)
Terminology of Cryptography (2019) (0)
Elliptic Curves (2019) (0)
Some thoughts on pseudoprimes (2021) (0)
Book Review: Finite element methods: Fifty years of the Courant element (1996) (0)
Subexponential Factoring Algorithms (2019) (0)
VI. The Main Tables (1988) (0)
IV. Update to the Introduction for the Second Edition (1988) (0)
Simple factoring algorithms (2013) (0)
History of integer factorization (2021) (0)
I. Introduction to the Short Tables (1988) (0)
Number theory review (2013) (0)
Theoretical and practical factoring (2013) (0)
Simple Protocols (2019) (0)

This paper list is powered by the following services:

Other Resources About Samuel S. Wagstaff Jr.

en.wikipedia.org

What Schools Are Affiliated With Samuel S. Wagstaff Jr.?

Samuel S. Wagstaff Jr. is affiliated with the following schools: