Difference between revisions of "Semiprime"
Jump to navigation
Jump to search
| Line 4: | Line 4: | ||
[[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]. | ||
| + | |||
| + | ==External Links== | ||
| + | *[http://www.research.att.com/~njas/sequences/A001358 Semiprimes] at the OEIS | ||
[[category:mathematics]] | [[category:mathematics]] | ||
| + | [[Category:Prime Numbers]] | ||
Revision as of 01:23, November 16, 2008
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