Strong prime

In mathematics, a strong prime is a prime number with certain special properties. The definition of strong primes is mainly coming from cryptography even if it's possible to find another definition more related with number theory than application.

In number theory, a strong prime is a prime number that is greater than the arithmetic mean of the nearest prime above and below (in other words, it's closer to the following than to the preceding prime). Or to put it algebraically, given a prime number p_n, where n is its index in the ordered set of prime numbers, p_n > ⁠p_{n − 1} + p_{n + 1}/2⁠. For example, 17 is the seventh prime: the sixth and eighth primes, 13 and 19, add up to 32, and half that is 16; 17 is greater than 16, and so 17 is a strong prime.

The first few strong primes are:

11, 17, 29, 37, 41, 59, 67, 71, 79, 97, 101, 107, 127, 137, 149, 163, 179, 191, 197, 223, 227, 239, 251, 269, 277, 281, 307, 311, 331, 347, 367, 379, 397, 419, 431, 439, 457, 461, 479, 487, 499 (sequence A051634 in the OEIS).

In a twin prime pair (p, p + 2) with p > 5, p is always a strong prime, since 3 must divide p − 2, which cannot be prime.

It's possible for a prime to be a strong prime both in the cryptographic sense and pure mathematical sense. For the sake of illustration, 439351292910452432574786963588089477522344331 is a strong prime in the theoretic sense because the arithmetic mean of its two neighboring primes is 62 less. Without the aid of a computer, this number would be a strong prime in the cryptographic sense because 439351292910452432574786963588089477522344330 has the large prime factor 1747822896920092227343 (and in turn the number one less than that has the large prime factor 1683837087591611009), 439351292910452432574786963588089477522344332 has the large prime factor 864608136454559457049 (and in turn the number one less than that has the large prime factor 105646155480762397). Even using algorithms more advanced than trial division, these numbers would be difficult to factor by hand. For a modern computer algebra system, these numbers can be factored almost instantaneously. A cryptographically strong prime has to be much larger as number of ciphers than this example.

Corollary:

• p is sufficiently large to be useful in cryptography; typically this requires p to be too large for plausible computational resources to enable a cryptanalyst to factorise products of p with other strong primes.

In cryptography, a prime number p is said to be "strong" if the following conditions are satisfied.^[1]

Conditions to meet:

• p − 1 has large prime factors. That is, p = a₁q₁ + 1 for some integer a₁ and large prime q₁;
• q₁ − 1 has large prime factors. That is, q₁ = a₂q₂ + 1 for some integer a₂ and large prime q₂;
• p + 1 has large prime factors. That is, p = a₃q₃ − 1 for some integer a₃ and large prime q₃.

Some people suggest that in the key generation process in RSA cryptosystems, the modulus n should be chosen as the product of two strong primes. This makes the factorization of n = pq using Pollard's p − 1 algorithm computationally infeasible. For this reason, strong primes are required by the ANSI X9.31 standard for use in generating RSA keys for digital signatures. However, strong primes do not protect against modulus factorisation using newer algorithms such as Lenstra elliptic curve factorization and Number Field Sieve algorithm. Given the additional cost of generating strong primes RSA Security do not currently recommend their use in key generation. Similar (and more technical) argument is also given by Rivest and Silverman.^[1]

It is shown by Stephen Pohlig and Martin Hellman in 1978 that if all the factors of p − 1 are less than log^c p, then the problem of solving discrete logarithm modulo p is in P. Therefore, for cryptosystems based on discrete logarithm, such as DSA, it is required that p − 1 have at least one large prime factor.

The usage of strong primes for RSA algorithm and the security itself of any transaction using RSA reccomandation could be under risk in case of proof of the Riemann hypotesys. Infact the proof of this conjecture could disclose a way to locate prime numbers among the natural ones giving an indication of where to find specific prime numbers. Riemann assumption about the zeros of Zeta function is strictly related to the precsion in the location of primes numbers in given ranges of natural numbers. This dependency was clear since Eulero time who proposed a new form for Riemann function based on primes factors instead of natural numbers.

• Guide to Cryptography and Standards
• Example of strong prime numbers in java
• 3.1.4 What are Strong Primes and are they Necessary for the RSA System? - RSA Lab's explanation on strong vs weak primes