implements modular inversion based on the paper: `fast constant-time gcd computation and modular inversion` by Daniel J. Bernstein and Bo-Yin Yang.
Zero-dependency 256-bit unsigned integer arithmetic for cryptographic applications
Small modular arithmetic primitives for RustUse
A fast, comprehensive CTF toolkit for cryptographic encoding/decoding, classic ciphers, hash operations, and analysis tools
Small library for finding the modular multiplicative inverses.
Efficient, SVM-friendly implementations of common Secp256k1 functions
Math library for Combinatorics, Modular arithmetic & Number Theory utilities.
A wasm implementation of the SRA protocol
scalars modulo the group order of the secp256k1 curve
Stella is a software that finds prime k-tuplets (also called prime constellations).
MINSTD minimal standard MCG M31 random number generator
High-performance, constant-time, cryptography-grade number theory library for ClockCurve ecosystem