19,576
edits
Changes
Jump to navigation
Jump to search
Line 88:
Line 88: − ==References==+ − <references/> − − Line 97:
Line 94: − + + + + +
no edit summary
The security of [[public-key cryptography]] schemes such as [[RSA]] depend on the difficulty of prime factorization, if a pattern in the distribution of prime numbers is discovered, then such [[cryptographic]] schemes could become vulnerable to attack.
The security of [[public-key cryptography]] schemes such as [[RSA]] depend on the difficulty of prime factorization, if a pattern in the distribution of prime numbers is discovered, then such [[cryptographic]] schemes could become vulnerable to attack.
==See also==
==See Also==
* [[Composite number]]
* [[Composite number]]
* [[Perfect number]]
* [[Perfect number]]
==External Links==
==External links==
:[http://www.mersenne.org/ ''Great Internet Mersenne Prime Search'' project website]
:[http://www.mersenne.org/ ''Great Internet Mersenne Prime Search'' project website]
:[http://primes.utm.edu/ Prime Number resource Archive]
:[http://primes.utm.edu/ Prime Number resource Archive]
==References==
<references/>
[[Category:Number Theory]]
[[Category:Number Theory]]