kwantam / bls12-381_hashLinks
Fast and simple constant-time hashing to the BLS12-381 elliptic curve
☆43Updated 5 years ago
Alternatives and similar repositories for bls12-381_hash
Users that are interested in bls12-381_hash are comparing it to the libraries listed below
Sorting:
- BLS working standard draft☆39Updated 5 years ago
- Implementation of the Groth16 zk-SNARK proving system☆21Updated 6 years ago
- Implementation of the ZKB++ proof system☆19Updated 6 years ago
- DEPRECATED☆22Updated 4 years ago
- Rust library for building IQC: cryptography based on class groups of imaginary quadratic orders☆64Updated 2 years ago
- Sage implementation of the isogeny-and-pairing based VDF☆24Updated 4 years ago
- fft impl for ff::Field☆16Updated last year
- C++ codebase for highly composable zkSNARKs with commit-and-prove capabilities.☆39Updated 4 years ago
- Elliptic curve search experiments☆35Updated 2 years ago
- Multiprecision arithmetic & RSA accumulators, within SNARKs☆53Updated last year
- Aggregatable Distributed Key Generation☆46Updated 3 years ago
- Hyrax reference implementation: meta-repo with top-level makefile, etc☆37Updated 7 years ago
- Accumulators and Vector Commitments☆43Updated 2 years ago
- ☆32Updated 2 years ago
- Pointcheval Sanders signature☆27Updated 5 years ago
- Presentations about R1CS☆18Updated 6 years ago
- A proof-of-concept for stateless Bitcoin nodes.☆31Updated 6 years ago
- Algorand's reference implementation of bls signature scheme☆51Updated 2 years ago
- Rust library for efficient, succinct and modular set membership and non-membership proofs☆58Updated 4 years ago
- Argument systems for inner pairing products☆42Updated 10 months ago
- [RFC9380] Hash to curves - Rust reference implementation☆28Updated last year
- Hashing to Elliptic Curves☆81Updated 8 months ago
- Set of JavaScript based tools and Ethereum Solidity contracts for BulletProof based range proofs and confidential transactions☆30Updated 6 years ago
- addition chains☆20Updated 7 years ago
- zk-STARK for fibonacci sequence in Rust☆38Updated 5 years ago
- ☆22Updated 5 months ago
- An O(N\log{N}) time algorithm for computing all N proofs fast in the Pointproofs VC. Also, the O(N\log{N}) time Feist-Khovratovich algori…☆13Updated 4 years ago
- C++ implementation of VSS using LWE encryption and proofs☆15Updated 3 years ago
- Batch verification proposal for the zkSNARK verification with the same(!) circuit☆24Updated 5 years ago
- Arithmatic circuits convertible to R1CS based on Bulletproofs☆90Updated 2 years ago