Samuel S. Wagstaff Jr.

According to our database1, Samuel S. Wagstaff Jr. authored at least 16 papers between 1983 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Strengthening the Baillie-PSW primality test.
Math. Comput., 2021

2012
The Search for Aurifeuillian-Like Factorizations.
Integers, 2012

2010
The period of the Bell numbers modulo a prime.
Math. Comput., 2010

Provable Partial Key Escrow.
Int. J. Netw. Secur., 2010

2008
An Efficient Time-Bound Hierarchical Key Management Scheme for Secure Broadcasting.
IEEE Trans. Dependable Secur. Comput., 2008

Square form factorization.
Math. Comput., 2008

2006
Is There a Shortage of Primes for Cryptography?
Int. J. Netw. Secur., 2006

Dynamic Cryptographic Hash Functions.
IACR Cryptol. ePrint Arch., 2006

2002
MPQS with Three Large Primes.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001
Prime Numbers with a Fixed Number of One Bits or Zero Bits in Their Binary Representation.
Exp. Math., 2001

1999
Watermarking with quadratic residues.
Proceedings of the Security and Watermarking of Multimedia Contents, 1999

Cryptanalysis.
Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1997
Low-threat security patches and tools.
Proceedings of the 1997 International Conference on Software Maintenance (ICSM '97), 1997

1996
Aurifeuillian factorizations and the period of the Bell numbers modulo a prime.
Math. Comput., 1996

1984
An extended-precision operand computer for integer factoring.
Proceedings of the American Federation of Information Processing Societies: 1984 National Computer Conference, 1984

1983
New Ideas for Factoring Large Integers.
Proceedings of the Advances in Cryptology, 1983


  Loading...