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

use BinaryPolynomial when it is one in F2m

Browse Source
This commit is contained in:
Vincent Hanquez 2015-04-03 08:17:47 +01:00
parent 88ff52a10d
commit 827407fbed
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Crypto/Number/F2m.hs
View File

@ -34,7 +34,7 @@ addF2m = xor
{-# INLINE addF2m #-} {-# INLINE addF2m #-}
-- | Binary polynomial reduction modulo using long division algorithm. -- | Binary polynomial reduction modulo using long division algorithm.
modF2m :: Integer -- ^ Irreducible binary polynomial modF2m :: BinaryPolynomial -- ^ Irreducible binary polynomial
-> Integer -> Integer -> Integer -> Integer
modF2m fx = go modF2m fx = go
where where