Results 1 
3 of
3
The RabinMonier theorem for Lucas pseudoprimes
 Math. Comp
, 1997
"... 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. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
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.
CryptoBytes 3 (1), 1997
, 1997
"... 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 outli ..."
Abstract
 Add to MetaCart
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.
ON THE GENERALIZED FIBONACCI PSEUDOPRIMES
, 1988
"... In this paper the results established by the first two authors in [3], [4], and [5] are extended and generalized. After defining (in this section) classes of generalized Lucas numbers, {Vn(m)}9 governed by the positive integral parameter/??, the Fibonacci pseudoprimes ..."
Abstract
 Add to MetaCart
In this paper the results established by the first two authors in [3], [4], and [5] are extended and generalized. After defining (in this section) classes of generalized Lucas numbers, {Vn(m)}9 governed by the positive integral parameter/??, the Fibonacci pseudoprimes