Abstract. We give bounds on the number of pairs (P, Q)with0≤P, Q < n such that a composite number n is a strong Lucas pseudoprime with respect to the parameters (P, Q). 1.

this article we will examine these criteria. The position of RSA Laboratories is that virtually all of these requirements are unnecessary [10,11]. In particular, we will show that the relevance of strong primes to the security of RSA is, at best, doubtful. However, given this position, we will outline in this article 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.