haskell/cryptonite
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix bug in isProbablyPrime for small numbers

Browse Source 
Fix bug in isProbablyPrime where too many iterations were specified for numbers less than 100

Add clause to isProbablyPrime to use hardcoded values <= 2903
This commit is contained in:
Colin Atkinson 2016-12-30 17:18:42 -05:00
parent 0cec622ddf
commit 345f4cd141
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Crypto/Number/Prime.hs
View File

@ -38,7 +38,8 @@ import Data.Bits
isProbablyPrime :: Integer -> Bool isProbablyPrime :: Integer -> Bool
isProbablyPrime !n isProbablyPrime !n
| any (\p -> p `divides` n) (filter (< n) firstPrimes) = False | 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 | otherwise = False
-- | generate a prime number of the required bitsize (i.e. in the range -- | generate a prime number of the required bitsize (i.e. in the range