Useful mathematical words in Forth.

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

Modular arithmetic, promoting moduli to the type level

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.

MOMA is a Rust framework for exploring complex systems including cosmology, bioinformatics, number theory, algorithmic data analysis and cryptography through the lens of Moving Origin Modular Arithmetic.

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

Clockwork: A Modular Arithmetic library for C++

A Julia package to work with integers mod 2, including arrays

🍳 KimlikDAO js library

Abstract algebra library for Python (Work in progress)

C library for arbitrary-precision integer and rational computation.

Modular arithmetic in Agda

Prime factorization up to 128 bit integers

We implement the Schnorr proof system in assembler via the Jasmin toolchain, and prove the security (proof-of-knowledge and zero-knowledge) and the absence of leakage through timing side-channels of that implementation in EasyCrypt.

Command line interface for linear algebra and modular arithmetic operations

Modular square roots in Julia

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.

Implements Number Theory for error detection and correction

Additivie Homomorphic ElGamal encryption with range zero-knowledge proof and universal cast-as-intended proofs

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

Empirical investigation of grokking in KAN. Key finding: KAN groks multiplication 12x faster than MLP!

Sass files to create a vertical rhythm based on modular scales

Extension to GMP library that allows fast fixed-basis exponentiations, simultaneous exponentiation, and randomly choosing safe-primes.

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

Tiny Kotlin DSL for modular arithmetik

A library for computing modular GCD of univariate polynomials.

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

Java wrapper of GMP and GMP Modular Exponentiation Extension library (GMPMEE).