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

Corrected value boundaries in description of function.

Browse Source
This commit is contained in:
Carlos Rodriguez 2018-11-11 17:14:23 +01:00 committed by GitHub
parent 95f0f3d0c9
commit cc18bf41ee
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Crypto/Number/ModArithmetic.hs
View File

@ -97,7 +97,7 @@ inverseCoprimes g m =
Just i -> i Just i -> i
-- | Computes the Jacobi symbol (a/n). -- | Computes the Jacobi symbol (a/n).
-- 0 = a < n; n = 3 and odd. -- 0 ≤ a < n; n ≥ 3 and odd.
-- --
-- The Legendre and Jacobi symbols are indistinguishable exactly when the -- The Legendre and Jacobi symbols are indistinguishable exactly when the
-- lower argument is an odd prime, in which case they have the same value. -- lower argument is an odd prime, in which case they have the same value.
@ -120,4 +120,4 @@ jacobi a n
s = if nMod4 == 3 && a1Mod4 == 3 then -s' else s' s = if nMod4 == 3 && a1Mod4 == 3 then -s' else s'
n1 = n `mod` a1 n1 = n `mod` a1
in if a1 == 1 then Just s in if a1 == 1 then Just s
else fmap (*s) (jacobi n1 a1) else fmap (*s) (jacobi n1 a1)