gnark-crypto provides elliptic curve and pairing-based cryptography on BN, BLS12, BLS24 and BW6 curves. It also provides various algorithms (algebra, crypto) of particular interest to zero knowledge proof systems

goff (go finite field) is a unix-like tool that generates fast field arithmetic in Go.

Finite field and algebraic extension field arithmetic

Finite Field Operations on GPGPU

Cryptographic library written in JavaScript. Created at UZH as a part of an E-Voting project.

Crypto library written in pure Lua 5.1 which includes X25519, ChaCha20, BLAKE2s and more.

Error correction codes in python.

Lightweight C implementations of short error correcting codes including Reed Solomon over GF(8) and GF(16)

Implementation of finite field arithmetic and eliptic curve cryptography on the secp256k1 curve in ARM64 assembly

No description provided.

A finite-field library in C++

Implementation of encoder and decoder for Reed-Solomon code.

Finite Field operations for Pasta curves

An implementation of secp256k1 Algorithm

Finite field arithmetic library written for my research in cryptography

Basics of elliptic curves, EC over finite fields and ECDSA.

Masked AES S-box implementation using the ISW scheme in an embedded RISC-V environment. Portfolio artifact demonstrating side-channel resistant cryptographic implementation.

Standalone, zero-dependency C++ elliptic curve library implementing the Helios/Selene curve for FCMP++. Runtime-dispatched backends (portable, x64, AVX2, AVX-512 IFMA) with constant-time scalar multiplication, MSM, polynomial arithmetic, and ECFFT support.

In this directoy, you will find a composite finite field calculator for different matrix sizes. The default matrix size will deal with Galois fields GF(2), but the calculation will scale up to infinite power two GF.

Cryptofield is a library to work with discrete algebraic objects. Useful for research in discrete mathematics and cryptography

Elliptic Curve Cryptography and Field Arithmetic from scratch

GPU-accelerated Number-Theoretic Transform for ZK-Proof generation. Targets the NTT bottleneck (91% of Groth16 prover time) via two CUDA optimizations: async double-buffered pipeline eliminating CPU-GPU transfer overhead, and IADD3-path Montgomery multiplication reducing finite-field instruction latency. BLS12-381, Ampere sm_86, Nsight-profiled.

C library that provides a set of operations for elements of Galois field.

Python classes which allow for finite field arithmetic as well as matrix manipulation within this system.

Code for arithmetic with polynomials mod p and within finite fields. The code deals with various objects, such as integers modulo a number, elements in a finite field, and with arithmetic in finite fields.