number-theory

Python code to implement various number theory, elliptic curve and finite field computations.

A library of recreational mathematics and number theory related functions inspired by Project Euler

A performant NumPy extension for Galois fields and their applications

Generate the digits of Pi using a streaming algorithm

Abstract algebra library for Python (Work in progress)

Interesting math related algorithms and problems 🔣

Number theoretic transform

A Number Theory Library Adapted from Mathematic Fundamentals of Information Security Homework Codes

Application (Flask) to encrypt & decrypt mono-alphabetic (Caesar) and poly-alphabetic (Vigenere) ciphers and their Cryptanalysis using Genetic Algorithm (GA)

Cryptography course - Cryptography modules - classic chipers - DES function f - Number theory module

Library for finite field arithmetics and polynomial manipulation

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

Stable operators of fall.

The number-utility module makes it simple for you to do number manipulation and perform various operations on numbers.

Playing with numbers and their properties 📓 ✏️ 💮 (credit - http://www.numbergossip.com/)

A collection of some algorithms on generating numerous prime sequences

Multivariable Chinese Remainder Theorem

This Repository Contains All Project Euler Solutions By Me

A Python implementation of the Eisenstein Integers

Applying extended-euclidean-algorithm on negative powered number to find their inverses

Elgamal encrypted text hidden within pixels of images

My solutions for Project Euler problems. Solutions are in Python only so far.

These codes are written in the quest for python solutions to the well-known problems in Number Theory.

A prime number sieve

I aim to solve the first 50.

A library of useful funtions used in cryptography. For learning purposes only.

These are 10 of the most utilized data structures and algorithm problems with solutions that minimize iterations and buffer storage space in order to optimize space and time complexity. Please remove the documentation tags represented by ' ' ' which preceed and succeed the desired function to run and test the function on a Python 3.6.1 interpreter.

The Stable Matching or the Stable Marriage algorithm is a mathematical algorithm that finds stable matches between two equally sized sets of elements, the proposers and the acceptors. This project uses basic Python data structures to implement the algorithm.