-- | -- Module: Math.NumberTheory.Primes.Factorisation.Montgomery -- Copyright: (c) 2011 Daniel Fischer -- Licence: MIT -- Maintainer: Daniel Fischer -- Stability: Provisional -- Portability: Non-portable (GHC extensions) -- -- Factorisation of 'Integer's by the elliptic curve algorithm after Montgomery. -- The algorithm is explained at -- -- and -- -- -- The implementation is not very optimised, so it is not suitable for factorising numbers -- with only huge prime divisors. However, factors of 20-25 digits are normally found in -- acceptable time. The time taken depends, however, strongly on how lucky the curve-picking -- is. With luck, even large factors can be found in seconds; on the other hand, finding small -- factors (about 10 digits) can take minutes when the curve-picking is bad. -- -- Given enough time, the algorithm should be able to factor numbers of 100-120 digits, but it -- is best suited for numbers of up to 50-60 digits. {-# LANGUAGE BangPatterns #-} {-# LANGUAGE CPP #-} {-# LANGUAGE DataKinds #-} {-# LANGUAGE KindSignatures #-} {-# LANGUAGE LambdaCase #-} {-# OPTIONS_GHC -fno-warn-type-defaults #-} {-# OPTIONS_HADDOCK hide #-} module Math.NumberTheory.Primes.Factorisation.Montgomery ( -- * Complete factorisation functions -- ** Functions with input checking factorise , defaultStdGenFactorisation -- ** Functions without input checking , factorise' , stepFactorisation , defaultStdGenFactorisation' -- * Partial factorisation , smallFactors , stdGenFactorisation , curveFactorisation -- ** Single curve worker , montgomeryFactorisation , findParms ) where #include "MachDeps.h" import System.Random import Control.Monad.State.Strict #if __GLASGOW_HASKELL__ < 709 import Control.Applicative import Data.Word #endif import Data.Bits import Data.IntMap (IntMap) import qualified Data.IntMap as IM import Data.List (foldl') import Data.Maybe import GHC.TypeNats.Compat import Math.NumberTheory.Curves.Montgomery import Math.NumberTheory.Moduli.Class import Math.NumberTheory.Powers.General (highestPower, largePFPower) import Math.NumberTheory.Powers.Squares (integerSquareRoot') import Math.NumberTheory.Primes.Sieve.Eratosthenes import Math.NumberTheory.Primes.Sieve.Indexing import Math.NumberTheory.Primes.Testing.Probabilistic import Math.NumberTheory.Unsafe import Math.NumberTheory.Utils -- | @'factorise' n@ produces the prime factorisation of @n@, including -- a factor of @(-1)@ if @n < 0@. @'factorise' 0@ is an error and the -- factorisation of @1@ is empty. Uses a 'StdGen' produced in an arbitrary -- manner from the bit-pattern of @n@. factorise :: Integer -> [(Integer,Int)] factorise n | n < 0 = (-1,1):factorise (-n) | n == 0 = error "0 has no prime factorisation" | n == 1 = [] | otherwise = factorise' n -- | Like 'factorise', but without input checking, hence @n > 1@ is required. factorise' :: Integer -> [(Integer,Int)] factorise' n = defaultStdGenFactorisation' (mkStdGen $ fromInteger n `xor` 0xdeadbeef) n -- | @'stepFactorisation'@ is like 'factorise'', except that it doesn't use a -- pseudo random generator but steps through the curves in order. -- This strategy turns out to be surprisingly fast, on average it doesn't -- seem to be slower than the 'StdGen' based variant. stepFactorisation :: Integer -> [(Integer,Int)] stepFactorisation n = let (sfs,mb) = smallFactors 100000 n in sfs ++ case mb of Nothing -> [] Just r -> curveFactorisation (Just 10000000000) bailliePSW (\m k -> (if k < (m-1) then k else error "Curves exhausted",k+1)) 6 Nothing r -- | @'defaultStdGenFactorisation'@ first strips off all small prime factors and then, -- if the factorisation is not complete, proceeds to curve factorisation. -- For negative numbers, a factor of @-1@ is included, the factorisation of @1@ -- is empty. Since @0@ has no prime factorisation, a zero argument causes -- an error. defaultStdGenFactorisation :: StdGen -> Integer -> [(Integer,Int)] defaultStdGenFactorisation sg n | n == 0 = error "0 has no prime factorisation" | n < 0 = (-1,1) : defaultStdGenFactorisation sg (-n) | n == 1 = [] | otherwise = defaultStdGenFactorisation' sg n -- | Like 'defaultStdGenFactorisation', but without input checking, so -- @n@ must be larger than @1@. defaultStdGenFactorisation' :: StdGen -> Integer -> [(Integer,Int)] defaultStdGenFactorisation' sg n = let (sfs,mb) = smallFactors 100000 n in sfs ++ case mb of Nothing -> [] Just m -> stdGenFactorisation (Just 10000000000) sg Nothing m ---------------------------------------------------------------------------------------------------- -- Factorisation wrappers -- ---------------------------------------------------------------------------------------------------- -- | A wrapper around 'curveFactorisation' providing a few default arguments. -- The primality test is 'bailliePSW', the @prng@ function - naturally - -- 'randomR'. This function also requires small prime factors to have been -- stripped before. stdGenFactorisation :: Maybe Integer -- ^ Lower bound for composite divisors -> StdGen -- ^ Standard PRNG -> Maybe Int -- ^ Estimated number of digits of smallest prime factor -> Integer -- ^ The number to factorise -> [(Integer,Int)] -- ^ List of prime factors and exponents stdGenFactorisation primeBound sg digits n = curveFactorisation primeBound bailliePSW (\m -> randomR (6,m-2)) sg digits n -- | @'curveFactorisation'@ is the driver for the factorisation. Its performance (and success) -- can be influenced by passing appropriate arguments. If you know that @n@ has no prime divisors -- below @b@, any divisor found less than @b*b@ must be prime, thus giving @Just (b*b)@ as the -- first argument allows skipping the comparatively expensive primality test for those. -- If @n@ is such that all prime divisors must have a specific easy to test for structure, a -- custom primality test can improve the performance (normally, it will make very little -- difference, since @n@ has not many divisors, and many curves have to be tried to find one). -- More influence has the pseudo random generator (a function @prng@ with @6 <= fst (prng k s) <= k-2@ -- and an initial state for the PRNG) used to generate the curves to try. A lucky choice here can -- make a huge difference. So, if the default takes too long, try another one; or you can improve your -- chances for a quick result by running several instances in parallel. -- -- @'curveFactorisation'@ requires that small prime factors have been stripped before. Also, it is -- unlikely to succeed if @n@ has more than one (really) large prime factor. curveFactorisation :: Maybe Integer -- ^ Lower bound for composite divisors -> (Integer -> Bool) -- ^ A primality test -> (Integer -> g -> (Integer,g)) -- ^ A PRNG -> g -- ^ Initial PRNG state -> Maybe Int -- ^ Estimated number of digits of the smallest prime factor -> Integer -- ^ The number to factorise -> [(Integer,Int)] -- ^ List of prime factors and exponents curveFactorisation primeBound primeTest prng seed mbdigs n | ptest n = [(n,1)] | otherwise = evalState (fact n digits) seed where digits = fromMaybe 8 mbdigs mult 1 xs = xs mult j xs = [(p,j*k) | (p,k) <- xs] dbl (u,v) = (mult 2 u, mult 2 v) ptest = case primeBound of Just bd -> \k -> k <= bd || primeTest k Nothing -> primeTest rndR k = state (\gen -> prng k gen) perfPw = case primeBound of Nothing -> highestPower Just bd -> largePFPower (integerSquareRoot' bd) fact m digs = do let (b1,b2,ct) = findParms digs (pfs,cfs) <- repFact m b1 b2 ct if null cfs then return pfs else do nfs <- forM cfs $ \(k,j) -> mult j <$> fact k (if null pfs then digs+5 else digs) return (mergeAll $ pfs:nfs) repFact m b1 b2 count = case perfPw m of (_,1) -> workFact m b1 b2 count (b,e) | ptest b -> return ([(b,e)],[]) | otherwise -> do (as,bs) <- workFact b b1 b2 count return $ (mult e as, mult e bs) workFact m b1 b2 count | count == 0 = return ([],[(m,1)]) | otherwise = do s <- rndR m case s `modulo` fromInteger m of InfMod{} -> error "impossible case" SomeMod sm -> case montgomeryFactorisation b1 b2 sm of Nothing -> workFact m b1 b2 (count-1) Just d -> do let !cof = m `quot` d case gcd cof d of 1 -> do (dp,dc) <- if ptest d then return ([(d,1)],[]) else repFact d b1 b2 (count-1) (cp,cc) <- if ptest cof then return ([(cof,1)],[]) else repFact cof b1 b2 (count-1) return (merge dp cp, dc ++ cc) g -> do let d' = d `quot` g c' = cof `quot` g (dp,dc) <- if ptest d' then return ([(d',1)],[]) else repFact d' b1 b2 (count-1) (cp,cc) <- if ptest c' then return ([(c',1)],[]) else repFact c' b1 b2 (count-1) (gp,gc) <- if ptest g then return ([(g,2)],[]) else dbl <$> repFact g b1 b2 (count-1) return (mergeAll [dp,cp,gp], dc ++ cc ++ gc) ---------------------------------------------------------------------------------------------------- -- The workhorse -- ---------------------------------------------------------------------------------------------------- -- | @'montgomeryFactorisation' n b1 b2 s@ tries to find a factor of @n@ using the -- curve and point determined by the seed @s@ (@6 <= s < n-1@), multiplying the -- point by the least common multiple of all numbers @<= b1@ and all primes -- between @b1@ and @b2@. The idea is that there's a good chance that the order -- of the point in the curve over one prime factor divides the multiplier, but the -- order over another factor doesn't, if @b1@ and @b2@ are appropriately chosen. -- If they are too small, none of the orders will probably divide the multiplier, -- if they are too large, all probably will, so they should be chosen to fit -- the expected size of the smallest factor. -- -- It is assumed that @n@ has no small prime factors. -- -- The result is maybe a nontrivial divisor of @n@. montgomeryFactorisation :: KnownNat n => Word -> Word -> Mod n -> Maybe Integer montgomeryFactorisation b1 b2 s = case newPoint (getVal s) n of Nothing -> Nothing Just (SomePoint p0) -> do -- Small step: for each prime p <= b1 -- multiply point 'p0' by the highest power p^k <= b1. let q = foldl (flip multiply) p0 smallPowers z = pointZ q fromIntegral <$> case gcd n z of -- If small step did not succeed, perform a big step. 1 -> case gcd n (bigStep q b1 b2) of 1 -> Nothing g -> Just g g -> Just g where n = getMod s smallPrimes = takeWhile (<= b1) (2 : 3 : 5 : list primeStore) smallPowers = map findPower smallPrimes findPower p = go p where go acc | acc <= b1 `quot` p = go (acc * p) | otherwise = acc -- | The implementation follows the algorithm at p. 6-7 -- of -- by K. Gaj, S. Kwon et al. bigStep :: (KnownNat a24, KnownNat n) => Point a24 n -> Word -> Word -> Integer bigStep q b1 b2 = rs where n = pointN q b0 = b1 - b1 `rem` wheel qks = zip [0..] $ map (\k -> multiply k q) wheelCoprimes qs = enumAndMultiplyFromThenTo q b0 (b0 + wheel) b2 rs = foldl' (\ts (_cHi, p) -> foldl' (\us (_cLo, pq) -> us * (pointZ p * pointX pq - pointX p * pointZ pq) `rem` n ) ts qks) 1 qs wheel :: Word wheel = 210 wheelCoprimes :: [Word] wheelCoprimes = [ k | k <- [1 .. wheel `div` 2], k `gcd` wheel == 1 ] -- | Same as map (id *** flip multiply p) [from, thn .. to], -- but calculated in more efficient way. enumAndMultiplyFromThenTo :: (KnownNat a24, KnownNat n) => Point a24 n -> Word -> Word -> Word -> [(Word, Point a24 n)] enumAndMultiplyFromThenTo p from thn to = zip [from, thn .. to] progression where step = thn - from pFrom = multiply from p pThen = multiply thn p pStep = multiply step p progression = pFrom : pThen : zipWith (\x0 x1 -> add x0 pStep x1) progression (tail progression) -- primes, compactly stored as a bit sieve primeStore :: [PrimeSieve] primeStore = psieveFrom 7 -- generate list of primes from arrays list :: [PrimeSieve] -> [Word] list sieves = concat [[off + toPrim i | i <- [0 .. li], unsafeAt bs i] | PS vO bs <- sieves, let { (_,li) = bounds bs; off = fromInteger vO; }] -- | @'smallFactors' bound n@ finds all prime divisors of @n > 1@ up to @bound@ by trial division and returns the -- list of these together with their multiplicities, and a possible remaining factor which may be composite. smallFactors :: Integer -> Integer -> ([(Integer,Int)], Maybe Integer) smallFactors bd n = case shiftToOddCount n of (0,m) -> go m prms (k,m) -> (2,k) <: if m == 1 then ([],Nothing) else go m prms where prms = tail (primeStore >>= primeList) x <: ~(l,b) = (x:l,b) go m (p:ps) | m < p*p = ([(m,1)], Nothing) | bd < p = ([], Just m) | otherwise = case splitOff p m of (0,_) -> go m ps (k,r) | r == 1 -> ([(p,k)], Nothing) | otherwise -> (p,k) <: go r ps go m [] = ([(m,1)], Nothing) -- helpers: merge sorted lists merge :: (Ord a, Num b) => [(a, b)] -> [(a, b)] -> [(a, b)] merge xs [] = xs merge [] ys = ys merge xxs@(x@(p, k) : xs) yys@(y@(q, m) : ys) = case p `compare` q of LT -> x : merge xs yys EQ -> (p, k + m) : merge xs ys GT -> y : merge xxs ys mergeAll :: (Ord a, Num b) => [[(a, b)]] -> [(a, b)] mergeAll = \case [] -> [] [xs] -> xs (xs : ys : zss) -> merge (merge xs ys) (mergeAll zss) -- | For a given estimated decimal length of the smallest prime factor -- ("tier") return parameters B1, B2 and the number of curves to try -- before next "tier". -- Roughly based on http://www.mersennewiki.org/index.php/Elliptic_Curve_Method#Choosing_the_best_parameters_for_ECM testParms :: IntMap (Word, Word, Word) testParms = IM.fromList [ (12, ( 400, 40000, 10)) , (15, ( 2000, 200000, 25)) , (20, ( 11000, 1100000, 90)) , (25, ( 50000, 5000000, 300)) , (30, ( 250000, 25000000, 700)) , (35, ( 1000000, 100000000, 1800)) , (40, ( 3000000, 300000000, 5100)) , (45, ( 11000000, 1100000000, 10600)) , (50, ( 43000000, 4300000000, 19300)) , (55, ( 110000000, 11000000000, 49000)) , (60, ( 260000000, 26000000000, 124000)) , (65, ( 850000000, 85000000000, 210000)) , (70, (2900000000, 290000000000, 340000)) ] findParms :: Int -> (Word, Word, Word) findParms digs = maybe (wheel, 1000, 7) snd (IM.lookupLT digs testParms)