acw/simple_crypto
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Support modular inverses.

Browse Source
This commit is contained in:
Adam Wick
2018-04-14 07:05:57 -07:00
parent b1c659087d
commit c45235473a
4 changed files with 15033 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
tests/math/GenerateMathTests.hs
View File

@@ -137,7 +137,7 @@ main =
in if m == 0
then (Nothing, (), g''')
else (Just res, (), g''')
_ <- runGenerator g9 "barrett" () $ \ g () ->
g10<- runGenerator g9 "barrett" () $ \ g () ->
let (m, g') = randomVal (>= 0) g
(v, g'') = randomVal (>= 0) g'
barrett = barrett_u m
@@ -151,7 +151,7 @@ main =
in if me /= standard
then error "Barrett broken"
else (Just res, (), g'')
_ <- runGenerator g9 "fastmodexp" () $ \ g () ->
g11<- runGenerator g10 "fastmodexp" () $ \ g () ->
let (a, g') = randomVal (>= 0) g
(b, g'') = randomVal (>= 0) g'
(m, g''') = randomVal (>= 0) g'
@@ -164,6 +164,10 @@ main =
("m", m), ("u", bu barrett),
("k", fromIntegral (bk barrett))]
in (Just res, (), g''')
_ <- runGenerator g11 "modinv" Map.empty $
buildBasicLimitingGenerator (>= 0) $ \ a b ->
let res == recipModInteger a b
if b == 0 then Nothing else Just (recipModInteger a b)
return ()
-- Implement Barrett reduction using incredibly simplistic implementations, to