Semiprime
Encyclopedia : S : SE : SEM : Semiprime
In mathematics, a semiprime (also called biprime or 2-almost prime, or pq number) is a natural number that is the product of two (not necessarily distinct) prime numbers. The first few semiprimes are 4, 6, 9, 10, 14, 15, 21, 22, 25, 26, ... (sequence [[OEIS:A001358|A001358]] in OEIS).
Currently, the largest known semiprime is (230,402,457 − 1)2, which has over 18 million digits. This is the square of the largest known prime number; the square of any prime number is semiprime, so the largest known semiprime will always be the square of the largest known prime, unless the factors of the semiprime are not known.
Semiprimes are highly useful in the area of cryptography and number theory, most notably in public key cryptography, where they are used by RSA and pseudo-random number generators such as Blum Blum Shub. These methods rely on the fact that finding two large primes and multiplying them together is computationally simple, whereas finding the original factors appears to be difficult. In the RSA Factoring Challenge, RSA Security offers to award prizes up to $200,000 for the factoring of specific large semiprimes.
In practical cryptography, it is not sufficient to choose just any semiprime; a good number must evade a number of well-known special-purpose algorithms that can factor numbers of certain form. The factors p and q of n should be very large, around the same order of magnitude as the square root (in other words, n is not a smooth number); this makes trial division and Pollard's rho algorithm impractical. At the same time they cannot be too close together, or else another simple test can factor the number. The number may also be chosen so that none of p − 1, p + 1, q − 1, or q + 1 are smooth numbers, protecting against Pollard's p-1 algorithm or Williams' p plus 1 algorithm. These checks cannot take future algorithms or secret algorithms into account however, introducing the possibility that numbers in use today may be broken by special-purpose algorithms.
The value of Euler's totient function for a semiprime n = pq is particularly simple when p and q are distinct:
- φ(n) = n + 1 − (p + q)
External links
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.