kryptools 0.9.2__tar.gz → 0.9.3__tar.gz

{kryptools-0.9.2 → kryptools-0.9.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: kryptools
-Version: 0.9.2
+Version: 0.9.3
 Summary: Implemenation of same basic algorithms used in cryptography.
 Author-email: Gerald Teschl <gerald.teschl@univie.ac.at>
 Project-URL: Homepage, https://github.com/teschlg/kryptools

{kryptools-0.9.2 → kryptools-0.9.3}/kryptools/Zmod.py

@@ -62,6 +62,26 @@ class Zmod:
             self.group_order *= p**k
         return self.group_order
 
+    def generator(self, all = False) -> int:
+        """Return a generator of the group Z_n^*."""
+        for a in range(2, self.n):
+            if gcd(a, self.n) > 1:
+                continue
+            a = self(a)
+            if a.is_generator():
+                if all:
+                    self.order()
+                    return list( a**j for j in range(1, self.group_order) if gcd(j,self.group_order) == 1 )
+                return a
+
+    def star(self) -> int:
+        """Return a list of all elements of the group Z_n^*."""
+        elements = [ 1 ]
+        for a in range(2, self.n):
+            if gcd(a, self.n) > 1:
+                continue
+            elements.append(self(a))
+        return elements
 
 class ZmodPoint:
     "Represents a point in the ring Zmod."

{kryptools-0.9.2 → kryptools-0.9.3}/kryptools/__init__.py

@@ -3,7 +3,7 @@ Implemenation of same basic algorithms used in cryptography.
 """
 
 from .nt import egcd, cf, convergents, legendre_symbol, jacobi_symbol, sqrt_mod, euler_phi, carmichael_lambda, moebius_mu, order, crt
-from .primes import sieve_eratosthenes, is_prime, next_prime, previous_prime, random_prime, random_strongprime, is_safeprime, random_safeprime
+from .primes import sieve_eratosthenes, prime_pi, is_prime, next_prime, previous_prime, random_prime, random_strongprime, is_safeprime, random_safeprime
 from .factor import factorint, divisors
 from .dlp import dlog
 from .ec import EC_Weierstrass

{kryptools-0.9.2 → kryptools-0.9.3}/kryptools/primes.py

@@ -1,16 +1,19 @@
 """
 Tools for prime numbers:
     sieve_eratosthenes(B) a tuple of all primes up to including B
+    prime_pi(n) number of primes below or equal n
     is_prime(n) test if n is probably prime
     next_prime(n) find the next prime larger or equal n
     previous_prime(n) find the previous prime smaller or equal n
     random_prime(l) find a pseudorandom prime with bit length at least l
     random_strongprime(l) find a pseudorandom strong prime with bit length at least l
     is_safeprime(n) test if n is a safe prime
-    random_safeprime(n) find a pseudorandom safe prime with bit length at least l and ord(2)=(p-1)/2
+    random_safeprime(l) find a pseudorandom safe prime with bit length at least l and ord(2)=(p-1)/2
+    is_blumprime(n) test if n is a Blum prime
+    random_blumprime(l) find a pseudorandom Blum prime with bit length at least l
     miller_rabin_test(n, b) Miller-Rabin primality test with base b
 """
-from math import isqrt, gcd
+from math import isqrt, gcd, floor
 from random import randint
 from .nt import jacobi_symbol
 
@@ -18,6 +21,11 @@ from .nt import jacobi_symbol
 
 def sieve_eratosthenes(B: int) -> tuple:
     """Returns a tuple of all primes up to (including) `B`."""
+    if B < 2:
+        return ()
+    if B < 3:
+        return [2]
+    B= floor(B)
     B1 = (isqrt(B) - 1)//2
     B = (B - 1)//2
     isprime = [True] * (B + 1)  # to begin with, all odd numbers are potentially prime
@@ -30,6 +38,11 @@ def sieve_eratosthenes(B: int) -> tuple:
 
     return tuple([2] + [2 * q + 1 for q in range(1, B + 1) if isprime[q]])
 
+def prime_pi(x: float) -> int:
+    """Prime-counting function pi(x). Returns the number of primes below or equal `x`."""
+    return len(sieve_eratosthenes(x))
+
+
 # Primality testing
 
 
@@ -115,6 +128,18 @@ def random_safeprime(l: int) -> int:
         p += 24
     return p
 
+def is_blumprime(p: int) -> bool:
+    """Tests if a number is a Blum prime."""
+    return p % 4 == 3 and is_prime(p)
+
+def random_blumprime(l: int) -> int:
+    """Find a pseudorandom Blum prime with bit length at least `l`."""
+    p = randint(2 ** (l - 1), 2**l - 1)
+    p = p - (p % 4) + 3
+    while not is_prime(p):
+        p += 4
+    return p
+
 def _lucas_sequence(n, D, k):
     """Evaluate a Lucas sequence."""
     # P = 1

{kryptools-0.9.2 → kryptools-0.9.3}/kryptools.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: kryptools
-Version: 0.9.2
+Version: 0.9.3
 Summary: Implemenation of same basic algorithms used in cryptography.
 Author-email: Gerald Teschl <gerald.teschl@univie.ac.at>
 Project-URL: Homepage, https://github.com/teschlg/kryptools

{kryptools-0.9.2 → kryptools-0.9.3}/pyproject.toml

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