crocs-muni / cm_factorization
Complex multiplication based factorization
☆36Updated 3 years ago
Alternatives and similar repositories for cm_factorization:
Users that are interested in cm_factorization are comparing it to the libraries listed below
- Implements Coron's simplification of Coppersmith's algorithm☆42Updated last year
- CVP "trick" for CTF challenges☆130Updated last year
- ☆66Updated 4 years ago
- rkm0959 implements stuff☆43Updated 2 years ago
- A repository trying to collect things related to LLL☆71Updated 6 months ago
- Prime backdooring procedure to allow fast factorization of semiprimes☆22Updated 3 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆99Updated 3 months ago
- Coppersmith's method for multivariate polynomials☆160Updated last year
- Solving linear systems over GF(2) by manipulating bitvectors☆34Updated this week
- Repo for collecting part of my public CTF challenges☆40Updated 11 months ago
- ☆43Updated last week
- Automated cryptanalysis of substitution permutation network cipher☆29Updated 6 months ago
- Some crypto scripts which is useful in study and ctf☆28Updated 3 years ago
- Cryptography & CTF Writeups☆82Updated 2 years ago
- Implementation of attacks on cryptosystems☆71Updated 3 years ago
- SageMath/Python Toolkit for Cryptanalytic Research☆39Updated 2 years ago
- ☆37Updated last year
- ☆32Updated last year
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆74Updated 3 years ago
- Implements Coron's simplification of Coppersmith's algorithm☆10Updated 7 years ago
- Functions for solving linear inequalities in integers☆45Updated last month
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆38Updated 4 years ago
- My CTF challenges, especially cryptography☆25Updated 2 weeks ago
- Repository containing implementation of attacks on modern public key cryptosystems and symmetric key ciphers.☆128Updated last year
- Python's library written in Rust to quickly factor `n = pq` when around >50% bits of `p` and `q` are known which are distributed at rando…☆19Updated 3 years ago
- ☆12Updated 5 years ago
- Homemade implementation of Square Attack against 4 rounds AES☆14Updated 5 years ago
- SMT based attacks on non cryptographic PRNGs☆79Updated last year
- A Sage implementation of the ROCA attack☆23Updated last year
- Given p xor q and n=p*q for two unknown primes p and q, factor n and output p and q.☆20Updated 8 years ago