kryptools 0.1__py3-none-any.whl

kryptools/primes.py

@@ -0,0 +1,123 @@
+"""
+Tools for prime numbers:
+    sieve_eratosthenes(B) a tuple of all primes up to including B
+    isprime(n) test if n is probably prime
+    miller_rabin_test(n, b) Miller-Rabin primality test with base b
+"""
+from math import isqrt
+
+# Erathostenes
+
+def sieve_eratosthenes(B: int) -> list:
+    """ "Returns a list of all primes up to (including) max."""
+    B1 = (isqrt(B) -1)//2
+    B = (B - 1)//2
+    is_prime = [True] * (B + 1)  # to begin with, all numbers are potentially prime
+    # sieve out the primes p=2*q+1 starting at 3 in steps of 2 (ignoring even numbers)
+    for q in range(1, B1 + 1):
+        if is_prime[q]: # sieve out all multiples; numbers p*q with q<p were already sieved out previously
+            qq = (q << 1) * (q + 1)
+            p = (q << 1) | 1
+            is_prime[qq :: p] = [False] * ((B - qq) // p + 1)
+
+    return tuple([2] + [2 * q + 1 for q in range(1, B + 1) if is_prime[q]])
+
+# Primality testing
+
+
+def miller_rabin_test(n: int, bases: list[int] | int) -> bool:
+    """Run a Miller-Rabin test with given bases on n."""
+    if n < 2:
+        return False
+    if n % 2 == 0:
+        return n == 2
+    m = (n - 1) // 2
+    k = 1
+    while m % 2 == 0:
+        m //= 2
+        k += 1
+    if isinstance(bases, int):
+        bases = [bases]
+    for a in bases:
+        b = pow(a, m, n)
+        if b == 1 or b == n - 1:
+            return True
+        for _ in range(1, k):
+            b = pow(b, 2, n)
+            if b == 1:
+                return False
+            if b == n - 1:
+                return True
+    return False
+
+def isprime(n: int) -> bool:
+    """Test if an integer n if probable prime."""
+    if n < 18446744073709551616:  # https://miller-rabin.appspot.com
+        return miller_rabin_test(n, [2, 325, 9375, 28178, 450775, 9780504, 1795265022])
+    if n < 3317044064679887385961981:
+        return miller_rabin_test(n, [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41])
+    return miller_rabin_test(n, [2]) and _is_strong_lucas_prp(n)  # Baillie–PSW primality test
+
+
+def _lucas_sequence(n, D, k):
+    """Evaluate a Lucas sequence."""
+    # P = 1
+    Q = (1 - D)//4
+    U = 1
+    V = 1
+    Qk = Q
+    b = k.bit_length()
+    while b > 1:
+        U = (U * V) % n
+        V = (V * V - 2 * Qk) % n
+        Qk *= Qk
+        b -= 1
+        if (k >> (b - 1)) & 1:
+            U, V = U + V, V + U * D
+            if U & 1:
+                U += n
+            if V & 1:
+                V += n
+            U, V = U >> 1, V >> 1
+            Qk *= Q
+        Qk %= n
+    return U % n, V % n, Qk
+
+
+def _is_strong_lucas_prp(n: int) -> bool:
+    """Strong Lucas primality test."""
+    from math import gcd
+    from .nt import jacobi_symbol
+
+    # remove powers of 2 from n+1 (= k * 2**s)
+    k = (n + 1) // 2
+    s = 1
+    while k % 2 == 0:
+        k //= 2
+        s += 1
+    # gernerate parameters
+    D = 5
+    while True:
+        g = gcd(abs(D), n)
+        if 1 < g < n:
+            return False
+        if jacobi_symbol(D, n) == -1:
+            break
+        if D > 0:
+            D = -D - 2
+        else:
+            D = -D + 2
+
+    if D == 0:
+        return False
+
+    U, V, Qk = _lucas_sequence(n, D, k)
+
+    if U == 0 or V == 0:
+        return True
+    for _ in range(1, s):
+        V = (V*V - 2*Qk) % n
+        if V == 0:
+            return True
+        Qk = pow(Qk, 2, n)
+    return False

kryptools-0.1.dist-info/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2024 Gerald Teschl
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

kryptools-0.1.dist-info/METADATA

@@ -0,0 +1,35 @@
+Metadata-Version: 2.1
+Name: kryptools
+Version: 0.1
+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
+Project-URL: Issues, https://github.com/teschlg/kryptools/issues
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+License-File: LICENSE
+
+# kryptools
+Gerald Teschl <Gerald.Teschl@univie.ac.at>
+
+This package was written for my course on cryptography. Consequently its intention is
+mainly educational, that is, to show how basic algorithms are implemented. In particular,
+you are welcome to read (and modify) the source. Any suggestions on how to make the
+code more readable or make it better are welcome. However, my main goal is to keep
+it simple and readability will be preferred over small speed improvements.
+
+The tools contained are:
+
+* number theory: sqrt modulo primes, crt, continued fractions, etc.
+* primes: Sieve of Erathostenes, primality tests
+* solvers for discrete logarithms (naive, Pollard rho, Shanks baby step/giant step, index calculus, quadratic sieve)
+* integer factorization (Pollard p-1, Lentra's ECM, Dixon, basic quadratic sieve)
+* linear algebra: Hermite normal form, Gram-Schmidt
+* lattices: Babai rounding/nearest plane, lattice reduction
+
+* Matrix: a class for Matrices (inverse, det, reduced echelon form, etc.)
+* Poly: a class for polynomials (division, modulo)
+* Zmod: a class for the ring of integers modulo an integer

kryptools-0.1.dist-info/RECORD

@@ -0,0 +1,22 @@
+kryptools/Zmod.py,sha256=a6o9G4zYY2gVAfFk26Rp7A5PBq7lZwfPGpcoLvIiD9A,3601
+kryptools/__init__.py,sha256=Y11XqaBakobArs2pPy4npuvgxXwx5KP5DTFHR80Sku8,411
+kryptools/dlp.py,sha256=7uwpG19KchCCLm_O3I4kjzhr3Q4My81pISpnjE5ENsw,2462
+kryptools/dlp_bsgs.py,sha256=QXrEUXy8xBWUYUSszd_91q0fFkgS_fGP8lBqecK3uts,803
+kryptools/dlp_ic.py,sha256=EhbE5dTRBIAkrwvyZB2SpmtDYa2sYrRPcGkd4P6aeiw,5660
+kryptools/dlp_qs.py,sha256=_PU9hCNEsarQHnHCvIGEpVmEUeJy3GKLre53iIW6fI4,12328
+kryptools/dlp_rho.py,sha256=_eKsPtcEyuqwIppajDJD_Yg2bpJQnhHV3RavjK4uPjs,2357
+kryptools/ec.py,sha256=vkZqxiBrU65CD0HTji5VaUoWlxojjJwY2NGmjZgPuIY,12924
+kryptools/factor.py,sha256=ww9iemZoryFq4EeyuyF1scyULuRggoDy5nCx4afoy2c,4763
+kryptools/factor_ecm.py,sha256=mjfC3qplwRwdJ6CQWFO9osZkkfypigzBBnfl3zgSxs8,3773
+kryptools/factor_pm1.py,sha256=po0xL9AsgMPudSUvDHlaoBNXt0IGQOAWfp992K-_ho8,1401
+kryptools/factor_qs.py,sha256=Owd8y5dVI4dA7uAZJ7d1JG8mY2lyOaV37MxVERoD7mw,7290
+kryptools/la.py,sha256=_5sib8tieZpH6jCdk4s4xZNzO_6AlIWC9BWl_Q-ofz8,7621
+kryptools/lat.py,sha256=F0C87RIwUSP71djPoZbO1NIb4A1zrK6JsrT708DdsP8,5739
+kryptools/nt.py,sha256=Uvij66tsw4fX5VfkD0IN33cKNvV1mX2qfb73VB4oRJk,8950
+kryptools/poly.py,sha256=TUUWebAQbcb5QLeh_-BnJJN73cztKGa-QqT54WZ2m1o,7678
+kryptools/primes.py,sha256=zRdu2qo77m9ZwVYzJ4Yta22BZ9f7sVGX5tpHzB8dNPk,3329
+kryptools-0.1.dist-info/LICENSE,sha256=nbdxuiueFAHRMXONMrQxyVQN2Eaihou4_txaLrrxKy4,1070
+kryptools-0.1.dist-info/METADATA,sha256=Ez-BNCP9voyB8PPj8zPQE4o0rQ_1aAyvvT8IDRDKYFQ,1649
+kryptools-0.1.dist-info/WHEEL,sha256=mguMlWGMX-VHnMpKOjjQidIo1ssRlCFu4a4mBpz1s2M,91
+kryptools-0.1.dist-info/top_level.txt,sha256=jliXVAiLrIHcNLJgMHbQjo2F2Q3Ospv1jx6BAIM-6gI,10
+kryptools-0.1.dist-info/RECORD,,

kryptools-0.1.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (70.1.1)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

kryptools-0.1.dist-info/top_level.txt

@@ -0,0 +1 @@
+kryptools