NonupleBroken / ExtendMT19937PredictorLinks
Predict and Backtrack MT19937 PRNG by putting 32 * 624 bits generated numbers. Python "random" standard library uses mt19937, so we can easily crack it.
☆39Updated 2 years ago
Alternatives and similar repositories for ExtendMT19937Predictor
Users that are interested in ExtendMT19937Predictor are comparing it to the libraries listed below
Sorting:
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆40Updated 5 years ago
- Solving linear systems over GF(2) by manipulating bitvectors☆54Updated 4 months ago
- Repo for collecting part of my public CTF challenges☆41Updated last year
- Archive of AAA CTF 2022 (XCTF competition)☆78Updated 9 months ago
- Nonce reuse attacks for AEAD ciphers, especially for the the most commonly used `ChaCha20-Poly1305` and `AES-GCM`.☆17Updated 9 months ago
- Challenge source code and author write-ups for KalmarCTF☆66Updated 5 months ago
- ☆49Updated last year
- An implementation of RSA extending Wiener attack☆15Updated 3 years ago
- official writeup for starctf2023☆32Updated 2 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…☆19Updated 4 years ago
- Automatic use of House of Some & House of Illusion.☆68Updated 3 months ago
- Implementation of cryptographic attacks. Mainly reproduction of recent cryptographic papers.☆15Updated 8 months ago
- Official repository containing files related to N1CTF 2022☆44Updated 2 years ago
- challenges 2024 woohoo☆17Updated 11 months ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆110Updated 8 months ago
- Code for "Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA"☆14Updated 7 months ago
- SCTF 2021☆25Updated 3 years ago
- Archive of AAA CTF 2023 (XCTF competition)☆37Updated last year
- Some crypto scripts which is useful in study and ctf☆29Updated 3 years ago
- D3CTF-2022-Official-Writeup☆16Updated 3 years ago
- ☆52Updated this week
- ☆29Updated 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.☆22Updated 8 years ago
- PWNable pyjail☆12Updated 7 months ago
- ☆42Updated 2 years ago
- Official source code and writeups of *CTF2022☆75Updated 3 years ago
- SUSCTF2022 Official Writeup☆46Updated 3 years ago
- SAEG: Stateful Automatic Exploit Generation, an AEG framework for CGC / RHG and pwnable CTF challenges.☆157Updated 7 months ago
- Complex multiplication based factorization☆38Updated 3 years ago
- ☆12Updated last month