Fix bug in isProbablyPrime for small numbers

Fix bug in isProbablyPrime where too many iterations were specified for numbers less than 100 Add clause to isProbablyPrime to use hardcoded values <= 2903
2016-12-30 17:18:42 -05:00 · 2016-12-30 17:18:42 -05:00 · 345f4cd141
commit 345f4cd141
parent 0cec622ddf
1 changed files with 2 additions and 1 deletions
--- a/Crypto/Number/Prime.hs
+++ b/Crypto/Number/Prime.hs
@ -38,7 +38,8 @@ import Data.Bits
 isProbablyPrime :: Integer -> Bool
 isProbablyPrime !n
    | any (\p -> p `divides` n) (filter (< n) firstPrimes) = False
-    | primalityTestFermat 50 (n`div`2) n                   = primalityTestMillerRabin 30 n
+    | n >= 2 && n <= 2903                                  = True
+    | primalityTestFermat 50 (n `div` 2) n                 = primalityTestMillerRabin 30 n
    | otherwise                                            = False

 -- | generate a prime number of the required bitsize (i.e. in the range