There are 1 repository under modular-arithmetic topic.
Some extra functions to work with modular arithmetics using native JS implementation of BigInt.
NEWS! We will soon release a TypeScript transpilation and improvement of this library. Self-contained cryptographic library for use in electronic voting clients. Complete documentation with references to the literature makes it good teaching material.
📚 KimlikDAO js library
Abstract algebra library for Python (Work in progress)
Clockwork: A Modular Arithmetic library for C++
A Julia package to work with integers mod 2, including arrays
Sass files to create a vertical rhythm based on modular scales
A library for number theory and modular arithmetic algorithms in Python e.g. Pollard Rho, Miller–Rabin primality test, Cipolla, etc.
Extension to GMP library that allows fast fixed-basis exponentiations, simultaneous exponentiation, and randomly choosing safe-primes.
Implementation of the Tonelli-Shanks algorithm for computing square roots modulo a prime number.
Modular square roots in Julia
Prime factorization up to 128 bit integers
Pure-Python library that provides a selection of Sophie Germain primes that are organized by representation size.
Tiny Kotlin DSL for modular arithmetik
From basic algorithms like Sieve, Bitwise-sieve, Segmnted-sieve, Modular Arithmetic, Big Mod to Primality test, CRT etc. all other advance number theory algorithms.
Java wrapper of GMP and GMP Modular Exponentiation Extension library (GMPMEE).
Python public-key encryption / decryption (simple RSA implementation example)
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.
Number Necklace Generator
Implementation of the RSA algorithm | Python | Command-line interface | Miller-Rabin | Extended Euclidean algorithm
Toy program for learning cryptography.
Fast, typed, tested, documented, self-contained big integer library in pure TypeScript with zero dependencies.
Response to Mathologer's challenge in this video: https://youtu.be/6ZrO90AI0c8
Math program with spread function and pseudorandom number generator.
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.
This is an encrypted local messaging app. The objective behing this project was implementing RSA in Python.