论文信息 - Fast Generation Of Random, Strong RSA Primes

Fast Generation Of Random, Strong RSA Primes

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.

Robert D. Silverman

[1] Robert D. Silverman,et al. A practical analysis of the elliptic curve factoring algorithm , 1993 .

[2] C. Pomerance,et al. The probability that a random probable prime is composite , 1989 .

[3] Carl Pomerance,et al. The pseudoprimes to 25⋅10⁹ , 1980 .

[4] Robert D. Silverman,et al. AN FFT EXTENSION TO THE P - 1 FACTORING ALGORITHM , 1990 .

[5] I. Damgård,et al. Average case error estimates for the strong probable prime test , 1993 .

[6] D. H. Lehmer,et al. New primality criteria and factorizations of 2^{}±1 , 1975 .