Difference between revisions of "Semiprime"
Jump to navigation
Jump to search
(added point about encryption) |
(added point about encryption) |
||
| Line 3: | Line 3: | ||
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 are listed at [http://mathworld.wolfram.com/Semiprime.html | + | [[Encryption]] algorithms, including [[RSA]] [[encryption]], typically rely on special large semiprimes. A table of such semiprimes are listed at [http://mathworld.wolfram.com/Semiprime.html MathWorld semiprime]. |
[[category:mathematics]] | [[category:mathematics]] | ||
Revision as of 03:30, September 4, 2007
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 are listed at MathWorld semiprime.