Results 1 
2 of
2
Fast Generation Of Random, Strong RSA Primes
, 1997
"... A number of cryptographic standards currently under development call for the use of strong primes in the generation of an RSA key. This paper suggests a fast way of generating random strong primes that also satisfy a number of other cryptographic requirements. The method requires no more time to ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
A number of cryptographic standards currently under development call for the use of strong primes in the generation of an RSA key. This paper suggests a fast way of generating random strong primes that also satisfy a number of other cryptographic requirements. The method requires no more time to generate strong primes than it takes to generate random primes.
On the Distributions of Pseudoprimes, Carmichael Numbers, and
, 2009
"... Building upon the work of Carl Pomerance and others, the central purpose of this discourse is to discuss the distribution of base2 pseudoprimes, as well as improve upon Pomerance's conjecture regarding the Carmichael number counting function [8]. All conjectured formulas apply to any base b ≥ ..."
Abstract
 Add to MetaCart
(Show Context)
Building upon the work of Carl Pomerance and others, the central purpose of this discourse is to discuss the distribution of base2 pseudoprimes, as well as improve upon Pomerance's conjecture regarding the Carmichael number counting function [8]. All conjectured formulas apply to any base b ≥ 2 for x ≥ x0(b). A table of base2 pseudoprime, 2strong pseudoprime, and Carmichael number counts up to 10 15 from [4] is included in the Appendix. We also discuss strong pseudoprimes and probabilistic primality testing. 1