A set of functions useful in cryptography and linear algebra
Cryptography318 is a package intended to provide utility for important cryptographic and linear algebra functions in Python. This package includes functions for generating primes, primality tests including AKS, Miller-Rabin, Baillie-PSW, functions for factoring integers including Pollard's P-1, Self-Initializing Quadratic Sieve, Pollard's Rho, and Lenstra's ECM factorization algorithm using both Montgomery curves over projective space and short Weierstrass curves, functions for solving discrete logarithm problems including Pollard's Rho method for logarithms, baby-step-giant-step, and Pohlig-Hellman, support for working with elliptic curve cryptography including 'fast power algorithm' and baby-step-giant-step, general algebra functions such as Chinese Remainder and the Euclidean Extended Algorithm for gcd's. In development is the index calculus method for solving DLP's.
$ pip install cryptography318
Release history Release notifications | RSS feed
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Hashes for cryptography318-0.5.0-py3-none-any.whl