kryptools 1.9.4__tar.gz → 1.9.5__tar.gz

{kryptools-1.9.4 → kryptools-1.9.5}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: kryptools
-Version: 1.9.4
+Version: 1.9.5
 Summary: Implemenation of same basic algorithms used in cryptography.
 Author-email: Gerald Teschl <gerald.teschl@univie.ac.at>
 License: MIT

{kryptools-1.9.4 → kryptools-1.9.5}/kryptools/Zmod.py

@@ -2,8 +2,9 @@
 Ring of intergers modulo `n`.
 """
 
-from math import gcd
+from math import gcd, floor
 from random import randint
+from fractions import Fraction
 from .factor import factorint
 from .primes import is_prime
 from .nt import sqrt_mod, crt
@@ -60,6 +61,13 @@ class Zmod:
     def __contains__(self, other: "ZmodPoint") -> bool:
         return isinstance(other, ZmodPoint) and self.n == other.ring.n
 
+    def decompress(self, x: int, d: int) -> "ZmodPoint":
+        "Decompress an integer `x` with at most `d` bits to Z_n."
+        if not isinstance(d, int) or d <= 0 or d >= self.n.bit_length():
+            raise ValueError("The number of bits must be between 1 and the bit length of the modulus.")
+        x %= 2**d
+        return ZmodPoint( floor(Fraction(x * self.n, 2**d) + Fraction(1, 2) ), self)
+
     def random(self, num: int = 0) -> "ZmodPoint":
         "Return a single random point or a list of random points."
         if num:
@@ -255,8 +263,14 @@ class ZmodPoint:
             return self.x
         return self.ring.n - self.x
 
+    def compress(self, d: int) -> list:
+        "Returns the value compressed to `d` bits."
+        if not isinstance(d, int) or d <= 0 or d > self.ring.n.bit_length():
+            raise ValueError("The number of bits must be between 1 and the bit length of the modulus.")
+        return floor(Fraction(self.x * 2**d, self.ring.n) + Fraction(1, 2) ) % 2**d
+
     def bits(self) -> list:
-        "Convert to a list of bits."
+        "Returns a list of bits."
         return [int(d) for d in str(format(self.x, "0" + str(int.bit_length(self.ring.n - 1)) + "b"))]
 
     def sharp(self):

{kryptools-1.9.4 → kryptools-1.9.5}/kryptools/__init__.py

@@ -5,7 +5,7 @@ Implemenation of same basic algorithms used in cryptography.
 __author__ = "Gerald Teschl"
 __copyright__ = "Copyright 2024-2026, Gerald Teschl"
 __license__ = "MIT License"
-__version__ = "1.9.4"
+__version__ = "1.9.5"
 __email__ = "Gerald.Teschl@univie.ac.at"
 
 from .nt import egcd, cf, convergents, legendre_symbol, jacobi_symbol, sqrt_mod, euler_phi, carmichael_lambda, moebius_mu, is_carmichael_number, order, crt

{kryptools-1.9.4 → kryptools-1.9.5}/kryptools/dlp_rho.py

@@ -12,6 +12,11 @@ def dlog_rho(a: int, b: int, n: int, m: int = None, brent=0) -> int:
     b %= n
     if not m:
         m = n - 1
+    else:
+        if pow(a, m, n) != 1:
+            raise ValueError("Incorrect order.")
+        if pow(b, m, n) != 1:
+            raise ValueError("DLP not solvable.")
     trys = 10
     max_iter = 10 * isqrt(m)  # stop iterating and try a different start value
 

{kryptools-1.9.4 → kryptools-1.9.5}/kryptools/factor_rho.py

@@ -9,7 +9,7 @@ from random import randint
 def factor_rho(n: int, x: int = 2, maxinit: int = 10, maxiter: int = 1000, brent: bool = True, verbose: int = 0) -> int | None:
     """Factor `n` using the Pollard's rho method with start value `x`."""
     if not maxiter:
-        maxiter = 10 * isqrt(n)  # stop iterating and try a different start value
+        maxiter = 3 * isqrt(isqrt(n))  # stop iterating and try a different start value
 
     def f(x: int) -> int:
         return (pow(x, 2, n) + 2) % n

{kryptools-1.9.4 → kryptools-1.9.5}/kryptools/poly.py

@@ -220,6 +220,12 @@ class Poly:
             return self.__class__(list(map(func, self.coeff)), modulus = list(map(func, self.modulus)))
         return self.__class__(list(map(func, self.coeff)), modulus = self.modulus, cyclic = self.cyclic)
 
+    def compress(self, d: int) -> list:
+        "Retun a list of compressed coefficients."
+        if not hasattr(self.coeff[0], "compress"):
+            raise ValueError("The unerlying ring does not seem to support compression.")
+        return [ c.compress(d) for c in self.coeff ]
+
     def _check_type(self, other):
         "Check if self and other can be added/multiplied."
         return isinstance(other, int) or (isinstance(other, Number) and isinstance(self.coeff[0], Number)) or type(other) == type(self.coeff[0])  # pylint: disable=C0123

{kryptools-1.9.4 → kryptools-1.9.5}/kryptools.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: kryptools
-Version: 1.9.4
+Version: 1.9.5
 Summary: Implemenation of same basic algorithms used in cryptography.
 Author-email: Gerald Teschl <gerald.teschl@univie.ac.at>
 License: MIT

{kryptools-1.9.4 → kryptools-1.9.5}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "kryptools"
-version = "1.9.4"
+version = "1.9.5"
 authors = [
   { name="Gerald Teschl", email="gerald.teschl@univie.ac.at" },
 ]