Fast generation of prime numbers and secure public-key cryptographic parameters

This publication has 58 references indexed in Scilit:

• Sieve algorithms for perfect power testing
  Algorithmica, 1993
• Primality Testing and Abelian Varieties Over Finite Fields
  Lecture Notes in Mathematics, 1992
• Factoring with cyclotomic polynomials
  Mathematics of Computation, 1989
• Factorization and Primality Testing
  Published by Springer Nature ,1989
• The generation of random numbers that are probably prime
  Journal of Cryptology, 1988
• Implementation of a new primality test
  Mathematics of Computation, 1987
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
  SIAM Journal on Computing, 1984
• On Distinguishing Prime Numbers from Composite Numbers
  Annals of Mathematics, 1983
• SECURITY OF NUMBER THEORETIC PUBLIC KEY CRYPTOSYSTEMS AGAINST RANDOM ATTACK, I
  Cryptologia, 1978
• The recognition problem for the set of perfect squares
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1966