Skip to main content

A set of functions useful in cryptography and linear algebra

Project description


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.

Required Packages

  • numpy


$ pip install cryptography318


License: MIT

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

cryptography318-0.5.0.tar.gz (29.8 kB view hashes)

Uploaded source

Built Distribution

cryptography318-0.5.0-py3-none-any.whl (33.7 kB view hashes)

Uploaded py3

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page