Metadata-Version: 2.1
Name: cryptography318
Version: 0.3.2
Summary: A set of functions useful in cryptography and linear algebra
Home-page: https://github.com/aarpyy/Cryptography
Author: Andrew Carpenter
Author-email: acarpent@oberlin.edu
License: UNKNOWN
Platform: UNKNOWN
Classifier: Development Status :: 2 - Pre-Alpha
Classifier: Intended Audience :: Education
Classifier: License :: Public Domain
Classifier: Operating System :: MacOS
Classifier: Operating System :: Microsoft :: Windows :: Windows 10
Classifier: Programming Language :: Python :: 3.10
Requires-Python: >=3.10
Description-Content-Type: text/markdown

# 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, 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
* sympy

## Install
```angular2html
$ pip install cryptography318
```

### License
This package is unlicensed and not intended for public use.

