New Ideas for Factoring Large Integers. - Carl Pomerance; Jeffrey W. Smith; Samuel S. Wagstaff Jr. (CRYPTO, 1983)

An extended-precision operand computer for integer factoring. - Jeffrey W. Smith; Samuel S. Wagstaff Jr. (AFIPS National Computer Conference, 1984)

Aurifeuillian factorizations and the period of the Bell numbers modulo a prime. - Samuel S. Wagstaff Jr. (Math. Comput., 1996)

Low-threat security patches and tools. - Mohd A. Bashar; Ganesh Krishnan; Markus G. Kuhn; Eugene H. Spafford; Samuel S. Wagstaff Jr. (ICSM, 1997)

Cryptanalysis. - Samuel S. Wagstaff Jr. (Algorithms and Theory of Computation Handbook, 1999)

Watermarking with quadratic residues. - Mikhail J. Atallah; Samuel S. Wagstaff Jr. (Security and Watermarking of Multimedia Contents, 1999)

Prime Numbers with a Fixed Number of One Bits or Zero Bits in Their Binary Representation. - Samuel S. Wagstaff Jr. (Exp. Math., 2001)

MPQS with Three Large Primes. - Paul C. Leyland; Arjen K. Lenstra; Bruce Dodson; Alec Muffett; Samuel S. Wagstaff Jr. (ANTS, 2002)

Dynamic Cryptographic Hash Functions. - William R. Speirs II; Samuel S. Wagstaff Jr. (IACR Cryptol. ePrint Arch., 2006)

Is There a Shortage of Primes for Cryptography? - Samuel S. Wagstaff Jr. (Int. J. Netw. Secur., 2006)

Square form factorization. - Jason E. Gower; Samuel S. Wagstaff Jr. (Math. Comput., 2008)

An Efficient Time-Bound Hierarchical Key Management Scheme for Secure Broadcasting. - Elisa Bertino; Ning Shang; Samuel S. Wagstaff Jr. (IEEE Trans. Dependable Secur. Comput., 2008)

Provable Partial Key Escrow. - Kooshiar Azimian; Javad Mohajeri; Mahmoud Salmasizadeh; Samuel S. Wagstaff Jr. (Int. J. Netw. Secur., 2010)

The period of the Bell numbers modulo a prime. - Peter L. Montgomery; Sangil Nahm; Samuel S. Wagstaff Jr. (Math. Comput., 2010)

The Search for Aurifeuillian-Like Factorizations. - Samuel S. Wagstaff Jr. (Integers, 2012)

Strengthening the Baillie-PSW primality test. - Robert Baillie; Andrew Fiori; Samuel S. Wagstaff Jr. (Math. Comput., 2021)