kryptools 1.6__tar.gz → 1.7__tar.gz

{kryptools-1.6 → kryptools-1.7}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: kryptools
-Version: 1.6
+Version: 1.7
 Summary: Implemenation of same basic algorithms used in cryptography.
 Author-email: Gerald Teschl <gerald.teschl@univie.ac.at>
 License: MIT
@@ -48,10 +48,12 @@ The tools contained are:
 * linear codes: Hamming distance, left standard form, parity check matrix
 
 * Matrix: a class for Matrices (inverse, det, reduced echelon form, kernel, etc.)
+* BinaryMatrix: a class for Matrices with binary entries (for much faster row operations)
 * Poly: a class for polynomials (division, modulo, factoring and irreducibility test over finite fields, Lagrange interpolation)
 * Zmod: a class for the ring of integers modulo an integer
 * GF2: a class for Galois fields GF(2^n)
-* Goppa: a class for encoding and decoding Goppa codes
+* BinaryCode: a class for encoding and decoding binary linear codes
+* GoppaCode: a class for encoding and decoding binary Goppa codes
 * CyclicCode: a class for encoding and decoding cyclic codes
 * ReedSolomonCode: a class for encoding and decoding Reed-Solomon codes
 * BCHCode: a class for encoding and decoding primitive narrow sense BCH codes

{kryptools-1.6 → kryptools-1.7}/README.md

@@ -30,10 +30,12 @@ The tools contained are:
 * linear codes: Hamming distance, left standard form, parity check matrix
 
 * Matrix: a class for Matrices (inverse, det, reduced echelon form, kernel, etc.)
+* BinaryMatrix: a class for Matrices with binary entries (for much faster row operations)
 * Poly: a class for polynomials (division, modulo, factoring and irreducibility test over finite fields, Lagrange interpolation)
 * Zmod: a class for the ring of integers modulo an integer
 * GF2: a class for Galois fields GF(2^n)
-* Goppa: a class for encoding and decoding Goppa codes
+* BinaryCode: a class for encoding and decoding binary linear codes
+* GoppaCode: a class for encoding and decoding binary Goppa codes
 * CyclicCode: a class for encoding and decoding cyclic codes
 * ReedSolomonCode: a class for encoding and decoding Reed-Solomon codes
 * BCHCode: a class for encoding and decoding primitive narrow sense BCH codes

{kryptools-1.6 → kryptools-1.7}/kryptools/GF2.py

@@ -35,7 +35,7 @@ class GF2:
     f6
 
     """
-    def __init__(self, n: int, modulus: int | None = None):
+    def __init__(self, n: int, modulus: int | None = None, cached = False):
         if not isinstance(n, int) or n < 1:
             raise ValueError(f"{n} is not a positive integer.")
         if not modulus:
@@ -55,6 +55,11 @@ class GF2:
         self.byteorder: str = "big"  # big|little
         self.mult_order = self.order - 1
         self.factors = {}  # factoring of the group order
+        self.cached = False  # use precomputed log/exp tables to speed up multiplication
+        self.log = None  # precomputed log table
+        self.exp = None  # precomputed exp table
+        if cached:
+            self.cache()
 
     def __repr__(self):
         return f"GF(2^{self.degree})"
@@ -115,6 +120,8 @@ class GF2:
 
     def generator(self) -> int | None:
         "Return a generator of the group GF(2^n)^*."
+        if self.cached:
+            return self.exp[1]
         if self.degree == 1:
             return self.one()
         for a in range(2, self.order):
@@ -143,6 +150,20 @@ class GF2:
             return Poly(coeff + [1])
         return Poly(list(reversed(coeff)))
 
+    def cache(self) -> None:
+        "Create a exp/log table to speed up multiplication."
+        if not self.cached:
+            self.exp = [ 0 ] * self.mult_order
+            self.log = [ 0 ] * self.order
+            g = self.generator()
+            gj = self.one()
+            for j in range(self.mult_order):
+                self.exp[j] = gj
+                self.log[gj.x] = j
+                gj *= g
+            self.cached = True
+
+
 class GF2nPoint:
     "Represents a point in the Galois field GF(2^n)."
 
@@ -174,8 +195,8 @@ class GF2nPoint:
         coeff = [int(d) for d in str(
             format(self.x, "0" + str(self.field.degree) + "b"))]
         if self.field.bitreversed:
-            return coeff
-        return list(reversed(coeff))
+            coeff.reverse()
+        return coeff
 
     def poly(self) -> "Poly":
         "Convert to a polynomial."
@@ -217,7 +238,11 @@ class GF2nPoint:
         if not isinstance(other, self.__class__):
             return NotImplemented
         if self.field != other.field:
-            raise NotImplementedError("Cannot add elements from different fields.")
+            raise NotImplementedError("Cannot multiply elements from different fields.")
+        if self.field.cached:
+            if self.x and other.x:
+                return self.field.exp[(self.field.log[self.x] + self.field.log[other.x]) % self.field.mult_order]
+            return self.field.zero()
         z = 0
         y = other.x
         if self.field.bitreversed:
@@ -260,12 +285,16 @@ class GF2nPoint:
     def __pow__(self, j: int) -> "GF2nPoint":
         if not isinstance(j, int):
             return NotImplemented
-        if not (self.x) and j < 0:
-            raise ValueError("Division by zero.")
-        j %= self.field.order - 1
+        if self.x == 0:
+            if j < 0:
+                raise ValueError("Division by zero.")
+            if j:
+                return self
+            return self.field.one()
+        j %= self.field.mult_order
+        if self.field.cached:
+            return self.field.exp[j * self.field.log[self.x] % self.field.mult_order]
         if self.field.order == 2:
-            if j == 0:
-                return self.field.one()
             return self
         if self.field.bitreversed:
             res = self.__class__(self.field.order >> 1, self.field)
@@ -341,7 +370,7 @@ class GF2nPoint:
         raise ValueError("sbox is only availaible for AES/MiniAES field.")
 
 # sbox for AES
-GF2_aes = GF2(8, 0b100011011)  # x^8 + x^4 + x^3 + x + 1 = AES
+GF2_aes = GF2(8, 0b100011011, cached = True)  # x^8 + x^4 + x^3 + x + 1 = AES
 
 aes_sbox = [99, 124, 119, 123, 242, 107, 111, 197, 48, 1, 103, 43, 254, 215, 171, 118,
  202, 130, 201, 125, 250, 89, 71, 240, 173, 212, 162, 175, 156, 164, 114, 192,

{kryptools-1.6 → kryptools-1.7}/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.6"
+__version__ = "1.7"
 __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
@@ -14,12 +14,12 @@ from .intfuncs import iroot, ilog, perfect_square, perfect_power, prime_power
 from .factor import factorint, divisors
 from .dlp import dlog
 from .ec import EC_Weierstrass
-from .la import Matrix, zeros, eye
+from .la import Matrix, zeros, eye, circulant, BinaryMatrix
 from .lat import gram_det, hadamard_ratio, hermite_nf, gram_schmidt, babai_round_cvp, babai_round_bnd, babai_plane_cvp, babai_plane_bnd, lagrange_lr, lll, random_unimodular_matrix
-from .poly import Poly, lagrange_interpolation
+from .poly import Poly, PolyBinMult, lagrange_interpolation
 from .Zmod import Zmod
 from .GF2 import GF2, GF2_aes, GF2_miniaes, GF2_ghash
-from .code import gen2pchk, hamming_dist, Goppa, CyclicCode, ReedSolomonCode, BCHCode
+from .code import gen2pchk, hamming_dist, BinaryCode, GolayCode, HammingCode, ReedMullerCode, GoppaCode, CyclicCode, ReedSolomonCode, BCHCode
 from .blockcipher import BlockCipher, bytexor
 from .aes import AESKeySchedule, AESCipher, AESBlockCipher
 from .des import list2int, int2list, permute, invert_permutation, rotate_left, SDESKeySchedule, SDESCipher, DESKeySchedule, DESCipher, DESBlockCipher