mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...

, a strong prime is a

prime number A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only way ...

with certain special properties. The definitions of strong primes are different in

cryptography Cryptography, or cryptology (from grc, , translit=kryptós "hidden, secret"; and ''graphein'', "to write", or ''-logia'', "study", respectively), is the practice and study of techniques for secure communication in the presence of adve ...

and

number theory Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Math ...

Definition 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, writing the sequence of prime numbers as (''p'', ''p'', ''p'', ...) = (2, 3, 5, ...), ''p'' is a strong prime if . 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, so 17 is a strong prime. The first few strong primes are : 11, 17, 29, 37, 41, 59, 67, 71, 79, 97,

101 101 may refer to: * 101 (number), the number * AD 101, a year in the 2nd century AD * 101 BC, a year in the 2nd century BC It may also refer to: Entertainment * ''101'' (album), a live album and documentary by Depeche Mode * "101" (song), a ...

107 107 may refer to: *107 (number), the number *AD 107, a year in the 2nd century AD *107 BC, a year in the 2nd century BC *107 (New Jersey bus) See also *10/7 (disambiguation) *Bohrium Bohrium is a synthetic chemical element with the symbol Bh a ...

127 127 may refer to: *127 (number), a natural number *AD 127, a year in the 2nd century AD *127 BC, a year in the 2nd century BC *127 (band), an Iranian band See also *List of highways numbered 127 Route 127 or Highway 127 can refer to multiple roads ...

, 137, 149,

163 Year 163 ( CLXIII) was a common year starting on Friday (link will display the full calendar) of the Julian calendar. At the time, it was known as the Year of the Consulship of Laelianus and Pastor (or, less frequently, year 916 ''Ab urbe cond ...

179 Year 179 (Roman numerals, CLXXIX) was a common year starting on Thursday (link will display the full calendar) of the Julian calendar. At the time, it was known as the Year of the Consulship of Aurelius and Veru (or, less frequently, year 932 ' ...

191 Year 191 (Roman numerals, CXCI) was a common year starting on Friday (link will display the full calendar) of the Julian calendar. At the time, it was known as the Year of the Consulship of Apronianus and Bradua (or, less frequently, year 944 ' ...

, 197,

223 __NOTOC__ Year 223 ( CCXXIII) was a common year starting on Wednesday (link will display the full calendar) of the Julian calendar. At the time, it was known as the Year of the Consulship of Maximus and Aelianus (or, less frequently, year 976 ' ...

227 Year 227 ( CCXXVII) was a common year starting on Monday (link will display the full calendar) of the Julian calendar. At the time, it was known as the Year of the Consulship of Senecio and Fulvius (or, less frequently, year 980 ''Ab urbe condi ...

, 239,

251 __NOTOC__ Year 251 ( CCLI) was a common year starting on Wednesday (link will display the full calendar) of the Julian calendar. At the time, it was known as the Year of the Consulship of Traianus and Etruscus (or, less frequently, year 1004 ' ...

269 Year 269 ( CCLXIX) was a common year starting on Friday (link will display the full calendar) of the Julian calendar. At the time, it was known as the Year of the Consulship of Claudius and Paternus (or, less frequently, year 1022 ''Ab urbe con ...

, 277, 281, 307, 311, 331, 347, 367, 379, 397, 419, 431, 439, 457, 461, 479, 487, 499 . 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.

Definition in cryptography

, a prime number ''p'' is said to be "strong" if the following conditions are satisfied.Ron Rivest and Robert Silverman, ''Are 'Strong' Primes Needed for RSA?'', Cryptology ePrint Archive: Report 2001/007. http://eprint.iacr.org/2001/007 * ''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 In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several ''factors'', usually smaller or simpler objects of the same kind ...

products of ''p'' with other strong primes. * ''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''. It is possible for a prime to be a strong prime both in the cryptographic sense and the number theoretic sense. For the sake of illustration, 439351292910452432574786963588089477522344331 is a strong prime in the number 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 than this example.

Application of strong primes in cryptography

Factoring-based cryptosystems

Some people suggest that in the key generation process in

RSA RSA may refer to: Organizations Academia and education * Rabbinical Seminary of America, a yeshiva in New York City *Regional Science Association International (formerly the Regional Science Association), a US-based learned society *Renaissance S ...

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 The American National Standards Institute (ANSI ) is a private non-profit organization that oversees the development of Standardization, voluntary consensus standards for products, services, processes, systems, and personnel in the United S ...

standard for use in generating RSA keys for

digital signature A digital signature is a mathematical scheme for verifying the authenticity of digital messages or documents. A valid digital signature, where the prerequisites are satisfied, gives a recipient very high confidence that the message was created b ...

s. 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.

Discrete-logarithm-based cryptosystems

It is shown by Stephen Pohlig and Martin Hellman in 1978 that if all the factors of ''p'' − 1 are less than log ''p'', then the problem of solving

discrete logarithm In mathematics, for given real numbers ''a'' and ''b'', the logarithm log''b'' ''a'' is a number ''x'' such that . Analogously, in any group ''G'', powers ''b'k'' can be defined for all integers ''k'', and the discrete logarithm log''b' ...

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.

Miscellaneous facts

A computationally large safe prime is likely to be a cryptographically strong prime. Note that the criteria for determining if a pseudoprime is a strong pseudoprime is by congruences to powers of a base, not by inequality to the arithmetic mean of neighboring pseudoprimes. When a prime is equal to the mean of its neighboring primes, it's called a balanced prime. When it's less, it's called a weak prime (not to be confused with a

weakly prime number A delicate prime, digitally delicate prime, or weakly prime number is a prime number where, under a given radix but generally decimal, replacing any one of its digits with any other digit always results in a composite number. Definition A pri ...

References

External links

Guide to Cryptography and Standards

- RSA Lab's explanation on strong vs weak primes {{Prime number classes Classes of prime numbers Theory of cryptography