cryptography318 0.1.8

A set of functions useful in cryptography and linear algebra

Cryptography318

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, Quadratic Sieve and Lenstra's Elliptic Curve factorization algorithm, functions for solving discrete logarithm problems including index calculus method, Pollard's Rho method for logarithms, baby-step-giant-step, and Pohlig-Hellman, support for working with Elliptic Curves including 'fast power algorithm' and baby-step-giant-step, general algebra functions such as Chinese Remainder and the Euclidean Extended Algorithm for gcd's, and support for matrices including Matrix and Linear Map objects that extend numpy's array to include more functionality such as solving non-square systems, solving systems over the field of integers, change-of-basis, etc.

Required Packages

• numpy
• sympy

Install

$ pip install cryptography318

License

This package is unlicensed and not intended for public use.