In RSA, we create a modulus of \(n=pq\), and where \(p\) and \(q\) are random prime numbers. A strong prime number (\(p\)) is when \(r\), \(s\) and \(t\) satisfy the following:
- (\(p-1\)) has a large prime factor of \(r\).
- (\(p+1\)) has a large prime factor of \(s\).
- (\(r-1\)) has a large prime factor of \(t\).
The following defines the Gordon method [1] of generating strong primes.