y011d4 / factor-from-random-known-bitsLinks
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 random.
☆19Updated 3 years ago
Alternatives and similar repositories for factor-from-random-known-bits
Users that are interested in factor-from-random-known-bits are comparing it to the libraries listed below
Sorting:
- Repo for collecting part of my public CTF challenges☆41Updated last year
- ☆47Updated last month
- Solving linear systems over GF(2) by manipulating bitvectors☆43Updated 2 months ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆104Updated 6 months ago
- ☆11Updated last month
- ☆21Updated 3 months ago
- Functions for solving linear inequalities in integers☆49Updated 2 months ago
- Automated cryptanalysis of substitution permutation network cipher☆31Updated 9 months ago
- my ctf chals☆10Updated 6 months ago
- Some writeups for some CTFs☆17Updated last year
- Challenge source code and author write-ups for KalmarCTF☆65Updated 3 months ago
- ☆33Updated last year
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆86Updated 4 years ago
- Predict and Backtrack MT19937 PRNG by putting 32 * 624 bits generated numbers. Python "random" standard library uses mt19937, so we can …☆39Updated 2 years ago
- ☆31Updated 2 years ago
- Some crypto scripts which is useful in study and ctf☆29Updated 3 years ago
- A pure python tool to implement/exploit the hash length extension attack☆33Updated last year
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆40Updated 4 years ago
- CVP "trick" for CTF challenges☆135Updated 2 years ago
- Complex multiplication based factorization☆38Updated 3 years ago
- My CTF challenges, especially cryptography☆25Updated 3 months ago
- rkm0959 implements stuff☆45Updated 2 years ago
- A toolkit for cryptanalysis using lattices.☆124Updated last year
- Coppersmith's method for multivariate polynomials☆166Updated last year
- ☆65Updated 2 months ago
- z3++☆26Updated 6 months ago
- Cryptography & CTF Writeups☆83Updated 2 years ago
- 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
- Fast lattice reduction using segmentation, multithreading, Seysen reduction and BLAS☆29Updated last month
- Collections of all CTF challenges made by me.☆17Updated last year