Python3 implementation of Cryptographic attacks. Applcations examples introduced on my blog.

Implementation of the Tonelli-Shanks algorithm for computing square roots modulo a prime number.

Abstract algebra library for Python (Work in progress)

Pure-Python library for working with modular arithmetic, congruence classes, and finite fields.

A library for number theory and modular arithmetic algorithms in Python e.g. Pollard Rho, Miller–Rabin primality test, Cipolla, etc.

A python script that generates VHDL files describing steps for a modular reduction in hardware

Pure-Python library that provides a selection of Sophie Germain primes that are organized by representation size.

Python public-key encryption / decryption (simple RSA implementation example)

Implementation of the RSA algorithm | Python | Command-line interface | Miller-Rabin | Extended Euclidean algorithm

Repository containing algorithmic solutions to Project Euler challenges. Each solution has been methodically developed, optimized, and rigorously tested. Engage in mathematical and computational problem-solving.

Toy program for learning cryptography.

Implementations of concepts from Berkeley CS 70 - Discrete Math and Probability

The Zmodn package provides a class for representing integers modulo a given prime number. This class can be used to applications such as cryptography and computer algebra.

Math program with spread function and pseudorandom number generator.

It's a small program that contains formulas for modular arithmetic, with real and complex numbers.

Response to Mathologer's challenge in this video: https://youtu.be/6ZrO90AI0c8

An algorithm that computes modular nested exponentiation efficiently.

The script allows you to encrypt and decrypt a message using a pair of prime numbers.

A short program that calculates the exact amount of change in dollar bills and coins that one would receive for a certain number of cents

I have worked on developing the raw implementation of RSA without using any library. It uses modular arithmetic to deal with large numbers. The program is working efficiently for 1024 bits of prime numbers. I have also tried using FPM (fast polynomial multiplication) over FFT and integrated everything a the socket program.