safe prime

Given a prime $q$ , if ${{q-1}\\over 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.

单词	SafePrime
释义	safe prime Given a prime $q$ , if ${{q-1}\\over 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.
随便看	example of Boolean algebras ExampleOfBoundedOperatorWithNoEigenvalues example of bounded operator with no eigenvalues ExampleOfCauchyMultiplicationRule example of Cauchy multiplication rule ExampleOfChainRule example of chain rule ExampleOfChangingVariable example of changing variable ExampleOfChuSpace example of Chu space ExampleOfClosedForm example of closed form ExampleOfCohomologyAndMayerVietorisSequence example of cohomology and Mayer-Vietoris sequence ExampleOfComputingLimitsUsingTaylorExpansion example of computing limits using Taylor expansion ExampleOfConformalMapping example of conformal mapping ExampleOfConstructionOfASchauderBasis example of construction of a Schauder basis ExampleOfContinuousBijectionsWhichAreNotHomeomorphisms example of continuous bijections which are not homeomorphisms ExampleOfContractiveSequence example of contractive sequence