release v0.1.8

1 files changed, 16 insertions, 29 deletions

diff --git a/frozen_deps/Cryptodome/Math/_IntegerNative.py b/frozen_deps/Cryptodome/Math/_IntegerNative.py
index 9b857ea..5f768e2 100644
--- a/frozen_deps/Cryptodome/Math/_IntegerNative.py
+++ b/frozen_deps/Cryptodome/Math/_IntegerNative.py
@@ -30,7 +30,7 @@
 
 from ._IntegerBase import IntegerBase
 
-from Cryptodome.Util.number import long_to_bytes, bytes_to_long
+from Cryptodome.Util.number import long_to_bytes, bytes_to_long, inverse, GCD
 
 
 class IntegerNative(IntegerBase):
@@ -280,13 +280,7 @@ class IntegerNative(IntegerBase):
         if self._value == 0:
             return 1
 
-        bit_size = 0
-        tmp = self._value
-        while tmp:
-            tmp >>= 1
-            bit_size += 1
-
-        return bit_size
+        return self._value.bit_length()
 
     def size_in_bytes(self):
         return (self.size_in_bits() - 1) // 8 + 1
@@ -318,22 +312,7 @@ class IntegerNative(IntegerBase):
         self._value = int(source)
 
     def inplace_inverse(self, modulus):
-        modulus = int(modulus)
-        if modulus == 0:
-            raise ZeroDivisionError("Modulus cannot be zero")
-        if modulus < 0:
-            raise ValueError("Modulus cannot be negative")
-        r_p, r_n = self._value, modulus
-        s_p, s_n = 1, 0
-        while r_n > 0:
-            q = r_p // r_n
-            r_p, r_n = r_n, r_p - q * r_n
-            s_p, s_n = s_n, s_p - q * s_n
-        if r_p != 1:
-            raise ValueError("No inverse value can be computed" + str(r_p))
-        while s_p < 0:
-            s_p += modulus
-        self._value = s_p
+        self._value = inverse(self._value, int(modulus))
         return self
 
     def inverse(self, modulus):
@@ -342,11 +321,7 @@ class IntegerNative(IntegerBase):
         return result
 
     def gcd(self, term):
-        r_p, r_n = abs(self._value), abs(int(term))
-        while r_n > 0:
-            q = r_p // r_n
-            r_p, r_n = r_n, r_p - q * r_n
-        return self.__class__(r_p)
+        return self.__class__(GCD(abs(self._value), abs(int(term))))
 
     def lcm(self, term):
         term = int(term)
@@ -393,3 +368,15 @@ class IntegerNative(IntegerBase):
         n1 = n % a1
         # Step 8
         return s * IntegerNative.jacobi_symbol(n1, a1)
+
+    @staticmethod
+    def _mult_modulo_bytes(term1, term2, modulus):
+        if modulus < 0:
+            raise ValueError("Modulus must be positive")
+        if modulus == 0:
+            raise ZeroDivisionError("Modulus cannot be zero")
+        if (modulus & 1) == 0:
+            raise ValueError("Odd modulus is required")
+
+        number_len = len(long_to_bytes(modulus))
+        return long_to_bytes((term1 * term2) % modulus, number_len)