Difference between revisions of "Semiprime"
Jump to navigation
Jump to search
(Undo revision 604856 by Willyonwheels6 (Talk)) |
m (link to de-orphan) |
||
| Line 1: | Line 1: | ||
A '''semiprime''' is the product of two (possibly equal) [[prime number]]s. | A '''semiprime''' is the product of two (possibly equal) [[prime number]]s. | ||
| − | Other names for a "semiprime" are biprime, 2-almost prime, and pq-number. | + | Other names for a "semiprime" are biprime, 2-[[almost prime]], and pq-number. |
[[Encryption]] algorithms, including [[RSA]] [[encryption]], typically rely on special large semiprimes. A table of such semiprimes is listed at [http://mathworld.wolfram.com/Semiprime.html MathWorld semiprime]. | [[Encryption]] algorithms, including [[RSA]] [[encryption]], typically rely on special large semiprimes. A table of such semiprimes is listed at [http://mathworld.wolfram.com/Semiprime.html MathWorld semiprime]. | ||
Revision as of 02:47, February 16, 2009
A semiprime is the product of two (possibly equal) prime numbers.
Other names for a "semiprime" are biprime, 2-almost prime, and pq-number.
Encryption algorithms, including RSA encryption, typically rely on special large semiprimes. A table of such semiprimes is listed at MathWorld semiprime.
External Links
- Semiprimes at the OEIS