pkruk / pylenstra
Implementation of ECM (Lenstra elliptic curve factorization). Small part of my Master Thesis, which I would like to share.
☆12Updated 2 years ago
Alternatives and similar repositories for pylenstra:
Users that are interested in pylenstra are comparing it to the libraries listed below
- Lenstra's factorization algorithm in Python☆16Updated 7 years ago
- Faster Montgomery and Joye ladder formulas for short Weierstrass elliptic curves☆20Updated 4 years ago
- Elliptic curves Rust reference implementation☆16Updated last year
- Differential fuzzing for elliptic curves☆23Updated last year
- Circuits for functions of interest to cryptography☆27Updated last year
- Stronger and Faster Side-Channel Protections for CSIDH☆19Updated 4 years ago
- ☆10Updated 3 years ago
- Reference implementations of post-quantum cryptographic primitives☆29Updated last year
- ☆19Updated 4 years ago
- A design for doing more private Signal groups using anonymous credentials based on algebraic MACs.☆14Updated 5 years ago
- Optimized Binary GCD for Modular Inversion☆43Updated 4 years ago
- Tornado is a compiler producing masked bitsliced implementations proven secure in the bit/register probing model☆18Updated 4 years ago
- ☆32Updated 3 years ago
- Attacks on Jarvis and Friday☆10Updated 5 years ago
- A test library for computing modular exponentiation in parallel using AVX-512 vector arithmetic☆12Updated last year
- Haraka is a secure and efficient short-input hash function.☆55Updated 7 years ago
- ☆28Updated 3 years ago
- Official SQIsign code, version under continuous development☆23Updated 3 weeks ago
- ☆13Updated 3 years ago
- MAYO C implementation☆16Updated 3 weeks ago
- Finalists to the NIST lightweight cryptography competition☆38Updated 2 years ago
- Anonymous messaging using mix networks☆43Updated 5 years ago
- Pyecm factors large integers (up to 50 digits) using the Elliptic Curve Method (ECM), a fast factoring algorithm.☆21Updated 3 years ago
- Quantum implementation of elliptic curve primitives☆32Updated 2 years ago
- Lecture notes on the Foundations of Isogeny-based Cryptography☆28Updated 6 months ago
- High Speed elliptic curve signature system using a 260-bit Granger Moss Prime.☆14Updated 3 years ago
- XRD: Scalable messaging system with cryptographic privacy.☆13Updated 4 years ago
- Fastgcd is a C implementation of an efficient algorithm to compute the pairwise GCDs of a collection of integers. The algorithm is due to…☆17Updated 10 months ago
- DES cracking using brute force algorithm and CUDA☆25Updated 7 years ago
- Auditing Applied Cryptography☆10Updated 5 years ago