Differences

This shows you the differences between two versions of the page.

--- wiki:donuts:winter2013 [2014/04/30 11:23]
jmb438
+++ wiki:donuts:winter2013 [2014/04/30 12:12] (current)
jmb438
@@ Line 15: / Line 15: @@
  ===== Semiprime Numbers =====
-"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 pseudorandom number generators such as Blum Blum Shub. These methods rely on the fact that finding two large primes and multiplying them together (resulting in a semiprime) is computationally simple, whereas finding the original factors appears to be difficult. In the RSA Factoring Challenge, RSA Security offered prizes for the factoring of specific large semiprimes and several prizes were awarded. The most recent such challenge closed in 2007." (http://en.wikipedia.org/wiki/Semiprime#Applications)
+"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 pseudorandom number generators such as Blum Blum Shub. These methods rely on the fact that finding two large primes and multiplying them together (resulting in a semiprime) is computationally simple, whereas finding the original factors appears to be difficult. In the RSA Factoring Challenge, RSA Security offered prizes for the factoring of specific large semiprimes and several prizes were awarded. The most recent such challenge closed in 2007." ([[http://en.wikipedia.org/wiki/Semiprime#Applications|Semiprime on Wikipedia]])
 For a simple example, find the prime factorization of the semiprime number 391. ((Dr. Warnick, Mar. 13, 2013))

Radio Astronomy Systems Research Group

Differences

Page Tools