icemonster / symbolic_mersenne_cracker
Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs
☆67Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for symbolic_mersenne_cracker
- Coppersmith's method for multivariate polynomials☆155Updated last year
- Solving linear systems over GF(2) by manipulating bitvectors☆27Updated this week
- SMT based attacks on non cryptographic PRNGs☆76Updated last year
- CVP "trick" for CTF challenges☆123Updated last year
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆97Updated 8 months ago
- ☆35Updated last month
- rkm0959 implements stuff☆42Updated 2 years ago
- Functions for solving linear inequalities in integers☆37Updated 2 weeks ago
- Repo for collecting part of my public CTF challenges☆39Updated 7 months ago
- ☆65Updated 4 years ago
- 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…☆18Updated 3 years ago
- Automated cryptanalysis of substitution permutation network cipher☆27Updated 2 months ago
- A repository trying to collect things related to LLL☆70Updated last month
- A toolkit for cryptanalysis using lattices.☆98Updated 11 months ago
- Complex multiplication based factorization☆35Updated 2 years ago
- Repository containing implementation of attacks on modern public key cryptosystems and symmetric key ciphers.☆115Updated 7 months ago
- ☆30Updated last year
- Cryptography & CTF Writeups☆83Updated last year
- My CTF challenges, especially cryptography☆22Updated 10 months ago
- A GDB+GEF-style debugger for unloading Python pickles☆59Updated 3 weeks ago
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆35Updated 4 years ago
- Implements Coron's simplification of Coppersmith's algorithm☆41Updated last year
- Some crypto scripts which is useful in study and ctf☆26Updated 3 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 7 years ago
- Challenges I created for CTF competitions.☆185Updated last month
- Python library for CTFer☆130Updated 2 months ago
- A Sage implementation of the ROCA attack☆22Updated last year
- Challenge source code from KalmarCTF 2023☆55Updated 7 months ago
- Predict MT19937 PRNG, from preceding 624 generated numbers. There is a specialization for the "random" of Python standard library.☆170Updated 3 years ago
- ☆37Updated last year