# safe prime

Given a prime $q$, if $\frac{q-1}{2}=p$, where $p$ is another prime number^{}, then $q$ is a safe prime. It follows that $q-1=2p$ (and thus a semiprime) and $p$ is a Sophie Germain prime^{}.

Every safe prime matches to a Sophie Germain prime this way, and some safe primes are Sophie Germain primes themselves too, matching to yet another safe prime. A set of primes linked in this way is called a Cunningham chain^{} of the first kind. For example, 2, 5, 11, 23, 47. With Pocklington’s criterion, one can prove the primality of a safe prime if one has first proven the primality of its matching Sophie Germain prime.

The first few safe primes are 5, 7, 11, 23, 47, 59, 83, 107, 167, 179, 227, … These are listed in A005385 of Sloane’s OEIS. As of 2010, the largest known safe prime is $183027\times {2}^{265441}-1$.

Safe primes have been used in various methods of cryptography, but the safety of their use depends not just on these mathematical properties but also on their being large enough that their multiples^{} can’t be factored in a reasonable period of time by contemporary computers.

## 0.1 External links

http://primes.utm.edu/primes/page.php?id=92223Information on the largest known Sophie Germain prime from the Prime Pages.

Title | safe prime |
---|---|

Canonical name | SafePrime |

Date of creation | 2013-03-22 15:49:31 |

Last modified on | 2013-03-22 15:49:31 |

Owner | PrimeFan (13766) |

Last modified by | PrimeFan (13766) |

Numerical id | 7 |

Author | PrimeFan (13766) |

Entry type | Definition |

Classification | msc 11A41 |