Metadata-Version: 2.1
Name: kryptools
Version: 0.3
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
Project-URL: Docs, https://github.com/teschlg/kryptools/tree/main/doc
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

Documentation can be found in the jupyter notebook
(currently incomplete: use the force, read the source).
