In number theory, a prime number p is a Sophie Germain prime if 2p + 1 is also prime. The number 2p + 1 associated with a Sophie Germain prime is called a safe prime. For example, 11 is a Sophie Germain prime and 2 × 11 + 1 = 23 is its associated safe prime. Sophie Germain primes are named after French mathematician Sophie Germain, who used them in her investigations of Fermat's Last Theorem. Sophie Germain primes and safe primes have applications in public key cryptography and primality testing. It has been conjectured that there are infinitely many Sophie Germain primes, but this remains unproven.
The first few Sophie Germain primes (those less than 1000) are
- 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, 173, 179, 191, 233, 239, 251, 281, 293, 359, 419, 431, 443, 491, 509, 593, 641, 653, 659, 683, 719, 743, 761, 809, 911, 953, ... OEIS: A005384
Hence, the first few safe primes are
- 5, 7, 11, 23, 47, 59, 83, 107, 167, 179, 227, 263, 347, 359, 383, 467, 479, 503, 563, 587, 719, 839, 863, 887, 983, 1019, 1187, 1283, 1307, 1319, 1367, 1439, 1487, 1523, 1619, 1823, 1907, ... OEIS: A005385
In cryptography much larger Sophie Germain primes like 1,846,389,521,368 + 11600 are required.
Two distributed computing projects, PrimeGrid and Twin Prime Search, include searches for large Sophie Germain primes. Some of the largest known Sophie Germain primes are given in the following table.
|Value||Number of digits||Time of discovery||Discoverer|
|2618163402417 × 21290000 − 1||388342||February 2016||Dr. James Scott Brown in a distributed PrimeGrid search using the programs TwinGen and LLR|
|18543637900515 × 2666667 − 1||200701||April 2012||Philipp Bliedung in a distributed PrimeGrid search using the programs TwinGen and LLR|
|183027 × 2265440 − 1||79911||March 2010||Tom Wu using LLR|
|648621027630345 × 2253824 − 1 and 620366307356565 × 2253824 − 1||76424||November 2009||Zoltán Járai, Gábor Farkas, Tímea Csajbók, János Kasza and Antal Járai|
|1068669447 × 2211088 − 1||63553||May 2020||Michael Kwok|
|99064503957 × 2200008 − 1||60220||April 2016||S. Urushihata|
|607095 × 2176311 − 1||53081||September 2009||Tom Wu|
|48047305725 × 2172403 − 1||51910||January 2007||David Underbakke using TwinGen and LLR|
|137211941292195 × 2171960 − 1||51780||May 2006||Járai et al.|
On 2 Dec 2019, Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, and Paul Zimmermann announced the computation of a discrete logarithm modulo the 240-digit (795 bit) prime RSA-240 + 49204 (the first safe prime above RSA-240) using a number field sieve algorithm; see Discrete logarithm records.
There is no special primality test for safe primes the way there is for Fermat primes and Mersenne primes. However, Pocklington's criterion can be used to prove the primality of 2p + 1 once one has proven the primality of p.
Just as every term except the last one of a Cunningham chain of the first kind is a Sophie Germain prime, so every term except the first of such a chain is a safe prime. Safe primes ending in 7, that is, of the form 10n + 7, are the last terms in such chains when they occur, since 2(10n + 7) + 1 = 20n + 15 is divisible by 5.
If q > 7 is a safe prime, then q divides 3(q−1)/2 − 1. (This follows from the fact that 3 is a quadratic residue mod q.)
With the exception of 7, a safe prime q is of the form 6k − 1 or, equivalently, q ≡ 5 (mod 6) – as is p > 3. Similarly, with the exception of 5, a safe prime q is of the form 4k − 1 or, equivalently, q ≡ 3 (mod 4) — trivially true since (q − 1) / 2 must evaluate to an odd natural number. Combining both forms using lcm(6, 4) we determine that a safe prime q > 7 also must be of the form 12k − 1 or, equivalently, q ≡ 11 (mod 12). It follows that 3 (also 12) is a quadratic residue mod q for any safe prime q > 7. (Thus, 12 is not a primitive root of any safe prime q > 7, and the only safe primes that are also full reptend primes in base 12 are 5 and 7.)
If p is a Sophie Germain prime greater than 3, then p must be congruent to 2 mod 3. For, if not, it would be congruent to 1 mod 3 and 2p + 1 would be congruent to 3 mod 3, impossible for a prime number. Similar restrictions hold for larger prime moduli, and are the basis for the choice of the "correction factor" 2C in the Hardy–Littlewood estimate on the density of the Sophie Germain primes.
If a Sophie Germain prime p is congruent to 3 (mod 4) (OEIS: A002515, Lucasian primes), then its matching safe prime 2p + 1 will be a divisor of the Mersenne number 2p − 1. Historically, this result of Leonhard Euler was the first known criterion for a Mersenne number with a prime index to be composite. It can be used to generate the largest Mersenne numbers (with prime indices) that are known to be composite.
Infinitude and densityEdit
Are there infinitely many Sophie Germain primes?
It is conjectured that there are infinitely many Sophie Germain primes, but this has not been proved. Several other famous conjectures in number theory generalize this and the twin prime conjecture; they include the Dickson's conjecture, Schinzel's hypothesis H, and the Bateman–Horn conjecture.
is Hardy–Littlewood's twin prime constant. For n = 104, this estimate predicts 156 Sophie Germain primes, which has a 20% error compared to the exact value of 190. For n = 107, the estimate predicts 50822, which is still 10% off from the exact value of 56032. The form of this estimate is due to G. H. Hardy and J. E. Littlewood, who applied a similar estimate to twin primes.
A sequence (p, 2p + 1, 2(2p + 1) + 1, ...) in which all of the numbers are prime is called a Cunningham chain of the first kind. Every term of such a sequence except the last is a Sophie Germain prime, and every term except the first is a safe prime. Extending the conjecture that there exist infinitely many Sophie Germain primes, it has also been conjectured that arbitrarily long Cunningham chains exist, although infinite chains are known to be impossible.
A prime number q is a strong prime if q + 1 and q − 1 both have some large (around 500 digits) prime factors. For a safe prime q = 2p + 1, the number q − 1 naturally has a large prime factor, namely p, and so a safe prime q meets part of the criteria for being a strong prime. The running times of some methods of factoring a number with q as a prime factor depend partly on the size of the prime factors of q − 1. This is true, for instance, of the p − 1 method.
Safe primes are also important in cryptography because of their use in discrete logarithm-based techniques like Diffie–Hellman key exchange. If 2p + 1 is a safe prime, the multiplicative group of integers modulo 2p + 1 has a subgroup of large prime order. It is usually this prime-order subgroup that is desirable, and the reason for using safe primes is so that the modulus is as small as possible relative to p.
A prime number p = 2q + 1 is called a safe prime if q is prime. Thus, p = 2q + 1 is a safe prime if and only if q is a Sophie Germain prime, so finding safe primes and finding Sophie Germain primes are equivalent in computational difficulty. The notion of a safe prime can be strengthened to a strong prime, for which both p − 1 and p + 1 have large prime factors. Safe and strong primes were useful as the factors of secret keys in the RSA cryptosystem, because they prevent the system being broken by some factorization algorithms such as Pollard's p − 1 algorithm. However, with the current factorization technology, the advantage of using safe and strong primes appears to be negligible.
Similar issues apply in other cryptosystems as well, including Diffie–Hellman key exchange and similar systems that depend on the security of the discrete log problem rather than on integer factorization. For this reason, key generation protocols for these methods often rely on efficient algorithms for generating strong primes, which in turn rely on the conjecture that these primes have a sufficiently high density.
In Sophie Germain Counter Mode, it was proposed to use the arithmetic in the finite field of order equal to the Sophie Germain prime 2128 + 12451, to counter weaknesses in Galois/Counter Mode using the binary finite field GF(2128). However, SGCM has been shown to be vulnerable to many of the same cryptographic attacks as GCM.
In the first version of the AKS primality test paper, a conjecture about Sophie Germain primes is used to lower the worst-case complexity from O(log12n) to O(log6n). A later version of the paper is shown to have time complexity O(log7.5n) which can also be lowered to O(log6n) using the conjecture. Later variants of AKS have been proven to have complexity of O(log6n) without any conjectures or use of Sophie Germain primes.
Pseudorandom number generationEdit
Similarly, Sophie Germain primes may be used in the generation of pseudo-random numbers. The decimal expansion of 1/q will produce a stream of q − 1 pseudo-random digits, if q is the safe prime of a Sophie Germain prime p, with p congruent to 3, 9, or 11 modulo 20. Thus "suitable" prime numbers q are 7, 23, 47, 59, 167, 179, etc. (OEIS: A000353) (corresponding to p = 3, 11, 23, 29, 83, 89, etc.) (OEIS: A000355). The result is a stream of length q − 1 digits (including leading zeros). So, for example, using q = 23 generates the pseudo-random digits 0, 4, 3, 4, 7, 8, 2, 6, 0, 8, 6, 9, 5, 6, 5, 2, 1, 7, 3, 9, 1, 3. Note that these digits are not appropriate for cryptographic purposes, as the value of each can be derived from its predecessor in the digit-stream.
In popular cultureEdit
- Specifically, Germain proved that the first case of Fermat's Last Theorem, in which the exponent divides one of the bases, is true for every Sophie Germain prime, and she used similar arguments to prove the same for all other primes up to 100. For details see Edwards, Harold M. (2000), Fermat's Last Theorem: A Genetic Introduction to Algebraic Number Theory, Graduate Texts in Mathematics, vol. 50, Springer, pp. 61–65, ISBN 9780387950020.
- The Top Twenty Sophie Germain Primes — from the Prime Pages. Retrieved 17 May 2020.
- "PrimeGrid's Sophie Germain Prime Search" (PDF). PrimeGrid. Archived (PDF) from the original on 2022-10-09. Retrieved 29 February 2016.
- "PrimeGrid's Sophie Germain Prime Search" (PDF). PrimeGrid. Archived (PDF) from the original on 2022-10-09. Retrieved 18 April 2012.
- The Prime Database: 183027*2^265440-1. From The Prime Pages.
- The Prime Database: 648621027630345*2^253824-1.
- The Prime Database: 620366307356565*2^253824-1
- The Prime Database: 1068669447*2^211088-1 From The Prime Pages.
- The Prime Database: 99064503957*2^200008-1 From The Prime Pages.
- The Prime Database: 607095*2^176311-1.
- The Prime Database: 48047305725*2^172403-1.
- The Prime Database: 137211941292195*2^171960-1.
- Krantz, Steven G. (2010), An Episodic History of Mathematics: Mathematical Culture Through Problem Solving, Mathematical Association of America, p. 206, ISBN 9780883857663.
- Shoup, Victor (2009), "5.5.5 Sophie Germain primes", A Computational Introduction to Number Theory and Algebra, Cambridge University Press, pp. 123–124, ISBN 9780521516440.
- Ribenboim, P. (1983), "1093", The Mathematical Intelligencer, 5 (2): 28–34, doi:10.1007/BF03023623, MR 0737682.
- Dubner, Harvey (1996), "Large Sophie Germain primes", Mathematics of Computation, 65: 393–396, CiteSeerX 10.1.1.106.2395, doi:10.1090/S0025-5718-96-00670-9, MR 1320893.
- Ribenboim, Paulo (1999), Fermat's Last Theorem for Amateurs, Springer, p. 141, ISBN 9780387985084.
- Wells, David (2011), Prime Numbers: The Most Mysterious Figures in Math, John Wiley & Sons, p. 35, ISBN 9781118045718,
If the strong prime k-tuples conjecture is true, then Cunningham chains can reach any length.
- Löh, Günter (1989), "Long chains of nearly doubled primes", Mathematics of Computation, 53 (188): 751–759, doi:10.1090/S0025-5718-1989-0979939-8, MR 0979939.
- Rivest, Ronald L.; Silverman, Robert D. (November 22, 1999), Are 'strong' primes needed for RSA? (PDF), archived (PDF) from the original on 2022-10-09
- Cheon, Jung Hee (2006), "Security analysis of the strong Diffie–Hellman problem", 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'06), St. Petersburg, Russia, May 28 – June 1, 2006, Proceedings (PDF), Lecture Notes in Computer Science, vol. 4004, Springer-Verlag, pp. 1–11, doi:10.1007/11761679_1.
- Gordon, John A. (1985), "Strong primes are easy to find", Proceedings of EUROCRYPT 84, A Workshop on the Theory and Application of Cryptographic Techniques, Paris, France, April 9–11, 1984, Lecture Notes in Computer Science, vol. 209, Springer-Verlag, pp. 216–223, doi:10.1007/3-540-39757-4_19.
- Yap, Wun-She; Yeo, Sze Ling; Heng, Swee-Huay; Henricksen, Matt (2013), "Security analysis of GCM for communication", Security and Communication Networks, doi:10.1002/sec.798.
- Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin (2004), "PRIMES is in P" (PDF), Annals of Mathematics, 160 (2): 781–793, doi:10.4007/annals.2004.160.781, JSTOR 3597229, archived (PDF) from the original on 2022-10-09
- Matthews, Robert A. J. (1992), "Maximally periodic reciprocals", Bulletin of the Institute of Mathematics and its Applications, 28 (9–10): 147–148, MR 1192408.
- Peterson, Ivars (Dec 21, 2002), "Drama in numbers: putting a passion for mathematics on stage", Science News,
[Jean E.] Taylor pointed out that the example of a Germain prime given in the preliminary text was missing the term "+ 1." "When I first went to see 'Proof' and that moment came up in the play, I was happy to hear the 'plus one' clearly spoken," Taylor says.
- Ullman, Daniel (2006), "Movie Review: Proof" (PDF), Notices of the AMS, 53 (3): 340–342, archived (PDF) from the original on 2022-10-09,
There are a couple of breaks from realism in Proof where characters speak in a way that is for the benefit of the audience rather than the way mathematicians would actually talk among themselves. When Hal (Harold) remembers what a Germain prime is, he speaks to Catherine in a way that would be patronizing to another mathematician.