kryptools 1.3.1__tar.gz → 1.3.3__tar.gz

{kryptools-1.3.1 → kryptools-1.3.3}/PKG-INFO

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

{kryptools-1.3.1 → kryptools-1.3.3}/kryptools/GF2.py

@@ -51,7 +51,7 @@ class GF2:
         self.order = 2**n  # 2**n
         self.print_hex: bool = True
         self.byteorder: str = "big"  # big|little
-        self.mult_order = self.order -1
+        self.mult_order = self.order - 1
         self.factors = {}  # factoring of the group order
 
     def __repr__(self):
@@ -99,6 +99,8 @@ class GF2:
 
     def generator(self) -> int | None:
         "Return a generator of the group GF(2^n)^*."
+        if self.power == 1:
+            return self(1)
         for a in range(2, self.order):
             a = self(a)
             if a.is_generator():
@@ -107,10 +109,10 @@ class GF2:
     def generators(self) -> list | None:
         "Return a generator for all generators of the group GF(2^n)^*."
         a = self.generator()
-        if a is not None:
-            for j in range(1, self.mult_order):
-                if gcd(j, self.mult_order) == 1:
-                    yield a**j
+        yield a
+        for j in range(2, self.mult_order):
+            if gcd(j, self.mult_order) == 1:
+                yield a**j
 
     def star(self) -> list:
         "Return a generator for all elements of the group GF(2^n)n^*."

{kryptools-1.3.1 → kryptools-1.3.3}/kryptools/Zmod.py

@@ -98,6 +98,10 @@ class Zmod:
         "Return a generator of the group Z_n^*."
         if not self.is_cyclic():
             return None
+        if self.n == 1:
+            return self(0)
+        if self.n == 2:
+            return self(1)
         for a in range(2, self.n):
             if gcd(a, self.n) > 1:
                 continue
@@ -109,17 +113,21 @@ class Zmod:
         "Return a generator for all generators of the group Z_n^*."
         a = self.generator()
         if a is not None:
+            yield a
             self.order()
-            for j in range(1, self.group_order):
+            for j in range(2, self.group_order):
                 if gcd(j, self.group_order) == 1:
                     yield a**j
 
     def star(self) -> list:
         "Return a generator for all elements of the group Z_n^*."
-        yield self(1)
-        for a in range(2, self.n):
-            if gcd(a, self.n) == 1:
-                yield self(a)
+        if self.n == 1:
+            yield self(0)
+        else:
+            yield self(1)
+            for a in range(2, self.n):
+                if gcd(a, self.n) == 1:
+                    yield self(a)
 
 
 class ZmodPoint:
@@ -221,6 +229,8 @@ class ZmodPoint:
 
     def order(self) -> int:
         "Compute the order of the point in the group Z_n^*."
+        if self.ring.n == 1:
+            return 1
         if self.x == 0 or gcd(self.x, self.ring.n) != 1:
             raise ValueError(f"{self.x} and {self.ring.n} are not coprime!")
         order = self.ring.order()  # use euler_phi(n) as our current guess

{kryptools-1.3.1 → kryptools-1.3.3}/kryptools/__init__.py

@@ -5,7 +5,7 @@ Implemenation of same basic algorithms used in cryptography.
 __author__ = "Gerald Teschl"
 __copyright__ = "Copyright 2024-2025, Gerald Teschl"
 __license__ = "MIT License"
-__version__ = "1.3.1"
+__version__ = "1.3.3"
 __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.3.1 → kryptools-1.3.3}/kryptools.egg-info/PKG-INFO

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

{kryptools-1.3.1 → kryptools-1.3.3}/pyproject.toml

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

{kryptools-1.3.1 → kryptools-1.3.3}/tests/test_GF2.py

@@ -33,3 +33,28 @@ def test_GF2_ops():
         for _ in range(num_tests):
             a = randint(1, gf.order-1)
             assert (gf(a)**-1).poly() == gf(a).poly().inv()
+
+def test_GF2_order():
+    for n in range(1, 8):
+        gf = GF2(n)
+        assert len(list(gf)) == gf.order
+        assert len(list(gf.star())) == gf.order - 1
+        assert len(list(gf.generators())) == euler_phi(gf.order - 1)
+
+def test_GF2P_order():
+    for n in range(1, 9):
+        gf = GF2(n)
+        one = gf(1)
+        for x in gf.star():
+            o = 1
+            xx = x
+            while xx != one:
+                o += 1
+                xx *=x
+            assert o == x.order()
+
+def test_Zmod_generator():
+    for n in range(1, 9):
+        gf = GF2(n)
+        a = gf.generator()
+        assert a.order() == gf.mult_order

{kryptools-1.3.1 → kryptools-1.3.3}/tests/test_Zmod.py

@@ -1,6 +1,6 @@
 import pytest
 from math import gcd
-from kryptools import Zmod, euler_phi
+from kryptools import Zmod, euler_phi, is_prime
 
 
 def test_Zmod_ops():
@@ -70,9 +70,26 @@ def test_Zmod_methods():
 
 
 def test_Zmod_order():
-    for n in range(2, 10):
-        Z_n = Zmod(n)
-        assert Z_n.order() == euler_phi(n)
+    for n in range(1, 100):
+        o = euler_phi(n)
+        assert Zmod(n).order() == o
+        assert len(list(Zmod(n).star())) == o
+
+def test_ZmodP_order():
+    for n in range(1,100):
+        ring = Zmod(n)
+        one = ring(1)
+        for x in ring.star():
+            o = 1
+            xx = x
+            while xx != one:
+                o += 1
+                xx *=x
+            assert o == x.order()
+
+def test_Zmod_field():
+    for n in range(1, 100):
+        assert Zmod(n).is_field() == is_prime(n)
 
 
 OEIS_A033948 = [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 17, 18, 19, 22, 23, 25, 26, 27,
@@ -80,7 +97,27 @@ OEIS_A033948 = [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 17, 18, 19, 22, 23, 25,
                 79, 81, 82, 83, 86, 89, 94, 97, 98, 101, 103, 106, 107, 109, 113, 118, 121, 122, 125,
                 127, 131, 134, 137, 139]
 
-
 def test_Zmod_cyclic():
     for n in range(2, OEIS_A033948[-1]+1):
         assert Zmod(n).is_cyclic() == (n in OEIS_A033948)
+
+OEIS_A046145 = [0, 1, 2, 3, 2, 5, 3, 0, 2, 3, 2, 0, 2, 3, 0, 0, 3, 5, 2, 0, 0, 7, 5, 0, 2, 7, 2, 0, 2, 0, 3, 0, 0, 3, 0,
+ 0, 2, 3, 0, 0, 6, 0, 3, 0, 0, 5, 5, 0, 3, 3, 0, 0, 2, 5, 0, 0, 0, 3, 2, 0, 2, 3, 0, 0, 0, 0, 2, 0, 0, 0,
+ 7, 0, 5, 5, 0, 0, 0, 0, 3, 0, 2, 7, 2, 0, 0, 3, 0, 0, 3, 0]
+
+def test_Zmod_generator():
+    for j, a in enumerate(OEIS_A046145):
+        ring = Zmod(j+1)
+        aa = ring.generator()
+        if aa is None:
+            aa = 0
+        else:
+            assert aa.order() == ring.order()
+        assert a == int(aa)
+
+def test_Zmod_generators():
+    for n in range(1, 100):
+        if Zmod(n).is_cyclic():
+            assert len(list(Zmod(n).generators())) == euler_phi(euler_phi(n))
+        else:
+            assert list(Zmod(n).generators()) == []