[Haskell-cafe] Elementary math question: primality test for huge numbers

[Christopher Howard]

Hi. I was working through a math chapter explaining the RSA algorithm,
and I was implementing it in Haskell for learning sake. However, the
chapter does not explain how you efficiently pick the two prime
numbers. I scanned through the WP page on primality tests but it was
somewhat overwhelming. What would be the standard primality test for
this sort of application, and is it already built in to Base somewhere?

-- 
Biblical creationism: http://tinyurl.com/qfyeg4a
Free Bible software: http://xiphos.org
Software freedom: http://tinyurl.com/qjnpnsm
Free computer operating system: http://tinyurl.com/7wczchu
Alternative to MS Office: http://tinyurl.com/aw9p6d4
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 473 bytes
Desc: OpenPGP digital signature
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20150823/33778abe/attachment.sig>