pornin / bingcdLinks
Optimized Binary GCD for Modular Inversion
☆45Updated 5 years ago
Alternatives and similar repositories for bingcd
Users that are interested in bingcd are comparing it to the libraries listed below
Sorting:
- Oblivious Pseudorandom Functions (OPRFs) using Prime-Order Groups☆38Updated last year
- SQISign: Short Quaternion and Isogeny Signature – C implementation based on PARI/GP (obsolete implementation)☆27Updated 2 years ago
- Bounds on divsteps iterations in safegcd☆55Updated last year
- ☆17Updated last week
- Fast constant-time AES implementations on 32-bit architectures☆67Updated last year
- Script generated finite field arithmetic for elliptic curve cryptography☆25Updated this week
- High Speed elliptic curve signature system using a 260-bit Granger Moss Prime.☆14Updated 4 years ago
- Banquet implementation☆14Updated 3 years ago
- ☆82Updated 5 years ago
- Circuits for functions of interest to cryptography☆28Updated last year
- Stronger and Faster Side-Channel Protections for CSIDH☆20Updated 4 years ago
- Faster Montgomery and Joye ladder formulas for short Weierstrass elliptic curves☆21Updated 5 years ago
- ☆28Updated 4 years ago
- Implementations of do255e and do255s in C and assembly☆25Updated 4 years ago
- C crypto library☆24Updated 2 years ago
- Slides from talks and other materials related to post-quantum crypto☆12Updated 4 years ago
- Haraka is a secure and efficient short-input hash function.☆58Updated 8 years ago
- High Assurance Cryptographic Software☆10Updated last week
- Optimized implementation of the Picnic signature scheme☆82Updated 3 years ago
- Reference repository on Lattice-based Cryptography☆26Updated last year
- Elliptic curves Rust reference implementation☆16Updated last year
- ABE GPSW scheme using BLS pairing implemented in Rust.☆15Updated 2 years ago
- Verifying constant-time code with symbolic execution☆44Updated 4 years ago
- Performance Evaluation of SHA-256 using SHA New Instructions.☆42Updated 6 months ago
- An efficient and generalized implementation of the IKOS-style KKW proof system (https://eprint.iacr.org/2018/475) for arbitrary rings.☆60Updated 2 years ago
- Fast and simple constant-time hashing to the BLS12-381 elliptic curve☆45Updated 5 years ago
- Reference implementations of post-quantum cryptographic primitives☆33Updated 3 months ago
- Differential fuzzing for elliptic curves☆24Updated 2 years ago
- NIST Lightweight Cryptography Primitives☆54Updated 3 years ago
- Intuitive Quantum Computation and Post-Quantum Cryptography☆63Updated 3 years ago