pkruk / pylenstraLinks
Implementation of ECM (Lenstra elliptic curve factorization). Small part of my Master Thesis, which I would like to share.
☆12Updated 3 years ago
Alternatives and similar repositories for pylenstra
Users that are interested in pylenstra are comparing it to the libraries listed below
Sorting:
- Lenstra's factorization algorithm in Python☆17Updated 8 years ago
- Optimized Binary GCD for Modular Inversion☆51Updated 5 years ago
- Differential fuzzing for elliptic curves☆24Updated 2 years ago
- General number field sieve for python☆18Updated 10 years ago
- Wait-Free Eras (PPoPP '20)☆10Updated 6 years ago
- Clockwork: A Modular Arithmetic library for C++☆12Updated 2 months ago
- Python implementation of Schoof's algorithm for counting the points on elliptic curves over finite fields☆43Updated 6 years ago
- Circuits for functions of interest to cryptography☆28Updated 2 years ago
- Cryptography in SageMath.☆10Updated 7 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 last year
- A test library for computing modular exponentiation in parallel using AVX-512 vector arithmetic☆12Updated 2 years ago
- Oblivious Pseudorandom Functions (OPRFs) using Prime-Order Groups☆38Updated last year
- ☆19Updated 5 years ago
- Elliptic curves Rust reference implementation☆16Updated last year
- Sample implementations of the attacks shown in https://eprint.iacr.org/2020/1456☆21Updated 4 years ago
- Optimizations for Pairing-Based Cryptography☆17Updated 4 years ago
- Snowshoe - Portable, Secure, Fast Elliptic Curve Math Library in C☆63Updated 7 years ago
- CADO-NFS is a complete implementation in C/C++ of the Number Field Sieve (NFS) algorithm for factoring integers. For official releases, p…☆30Updated 5 years ago
- A basic implementation of the Small Primes Number-Theoretic Transform (NTT) multiplication algorithm.☆24Updated 8 years ago
- Haraka is a secure and efficient short-input hash function.☆59Updated 8 years ago
- C++ STL for speed and cryptanalytic application☆11Updated last month
- Bounds on divsteps iterations in safegcd☆57Updated last year
- ☆32Updated 3 years ago
- Stronger and Faster Side-Channel Protections for CSIDH☆20Updated 5 years ago
- Elliptic curve mathematics including Tate and Weil pairings for BLS signatures and zk-SNARK algorithms.☆21Updated 11 months ago
- A Python implementation of the SPHINCS-256 scheme☆15Updated 9 years ago
- A rust implementation of Verifiable Secret Sharing over Finite Field.☆45Updated 5 years ago
- cgo wrappers around post-quantum cryptography primitives☆23Updated 7 years ago
- Signature scheme submitted to NIST's Post-Quantum Cryptography Project☆29Updated 8 years ago
- Lecture notes on the Foundations of Isogeny-based Cryptography☆31Updated last year