Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.
-
Updated
Apr 21, 2025 - Python
Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.
A library for number theory and modular arithmetic algorithms in Python e.g. Pollard Rho, Miller–Rabin primality test, Cipolla, etc.
Implementation of the RSA algorithm | Python | Command-line interface | Miller-Rabin | Extended Euclidean algorithm
Applying extended-euclidean-algorithm on negative powered number to find their inverses
An assortment of functions for number theory / discrete math type problems
Implementation of Various Asymmetric Crypto systems in pure python.
🗝️ Implementation of famous cryptography algorithms over computer networks. 🔐🔑
Code from Introduction to Computer Security course from PPGCC at UFPA with Roberto Samarone
Mathematical Implementation of the RSA Encryption Algorithm
Solution to HackerRank "littlepandapower" problem in mathematics/Number Theory section
Add a description, image, and links to the extended-euclidean-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the extended-euclidean-algorithm topic, visit your repo's landing page and select "manage topics."