edit modular_inverse

53507693 · quentin.fasler · 032a0098 · 53507693
Commit 53507693 authored 3 years ago by quentin.fasler
--- a/polynomial.py
+++ b/polynomial.py
@@ -122,16 +122,11 @@ def compute_bachet_bezout(a, b):
 def modular_inverse(a, n):
-    res = -1
+    bachet_bezout = compute_bachet_bezout(a,n)
-    inverse = -1
+    modular_inverse = bachet_bezout[0]
-    i = 0
+    if a * modular_inverse % n == 1:
-    while res != 1:
+        return modular_inverse
-        if a * i % n == 1:
+    return None
-            res = a * i % n
-            inverse = i
-            break
-        i += 1
-    return inverse
 def compute_lagrange_polynomial(points, prime_number):