Constantine: modular, high-performance, zero-dependency cryptography stack for verifiable computation, proof systems and blockchain protocols.
- Updated
Oct 21, 2025 - Nim
Constantine: modular, high-performance, zero-dependency cryptography stack for verifiable computation, proof systems and blockchain protocols.
Optimised bilinear pairings over elliptic curves
Elliptic curve search experiments
Nim implementation of BLS signature scheme (Boneh-Lynn-Shacham) over Barreto-Lynn-Scott (BLS) curve BLS12-381
bn254 pairing library for Cairo Zero
Convenience wrapper over Apache Milagro
Elliptic Curves and other algorithms
Implementation of Groth16 Zero-Knowledge Succinct Non-Interactive Argument of Knowledge Protocol using Rust
Decentralized authorization system based on Hyperledger Fabric and Proxy ReEncryption
League of Identity
Comparative Implementation of Bilinear Pairing (Optimal-Ate) on KSS-16 curve, BLS-12 curve, BN curve.
Pairing implementation for curves BN128 and BLS12-381
Basic C implementation of paring-friendly BN curve, Fp^18 finite field extension and so on
Write ups on Mathematical Cryptography
Fast BLS12-381 implementation in OCaml
Python library that bundles libsodium and provides wrappers for its Ristretto group functions.
GLV Decomposition to improve G2 scalar multiplication for KSS-16 curve for optimal-ate pairing
An improvement on the PoC for the privacy-preserving contact discovery scheme I implemented as part of my UCL masters degree
🚀 Implement high-performance BLS12-381 digital signatures in Zig with memory safety and C ABI bindings for seamless integration and interoperability.
Add a description, image, and links to the pairing-cryptography topic page so that developers can more easily learn about it.
To associate your repository with the pairing-cryptography topic, visit your repo's landing page and select "manage topics."