Home Explore Help
Sign In
CNI
/
HaskellCourse
3
0
Fork 0
Files Issues 0 Pull Requests 0 Wiki
Browse Source

Implement `modInv`

DricomDragon 5 years ago
parent
259c94a62e
commit
0bb9f4fb7f
1 changed files with 3 additions and 0 deletions
Split View Show Diff Stats
  1. 3 0
      tp/rsa/main.hs

+ 3 - 0
tp/rsa/main.hs
View File 

@@ -67,3 +67,6 @@ choosePrime b = head $ dropWhile (<= b) primeinf
 
 euclide::Int -> Int -> (Int, Int, Int)
 
 euclide a 0 = (a, 1, 0)
 
 euclide a b = let (d', u', v') = euclide b (mod a b) in (d', v', u' - (div a b) * v')
 
+
 
+modInv e n = let (_, d, _) = euclide e n in d
 
+