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.
☆40Updated 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☆41Updated 5 years ago
- ☆49Updated 2 years ago
- Solving linear systems over GF(2) by manipulating bitvectors☆73Updated 2 weeks ago
- Nonce reuse attacks for AEAD ciphers, especially for the the most commonly used `ChaCha20-Poly1305` and `AES-GCM`.☆22Updated last year
- Archive of AAA CTF 2022 (XCTF competition)☆78Updated last year
- An implementation of RSA extending Wiener attack☆16Updated 3 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
- Repo for collecting part of my public CTF challenges☆41Updated last year
- Automatic use of House of Some & House of Illusion.☆79Updated 2 months ago
- Challenge source code and author write-ups for KalmarCTF☆68Updated 8 months ago
- official writeup for starctf2023☆32Updated 2 years ago
- Archive of AAA CTF 2023 (XCTF competition)☆37Updated 2 years ago
- SCTF 2021☆25Updated 3 years ago
- ☆64Updated 3 weeks ago
- Official repository containing files related to N1CTF 2022☆44Updated 3 years ago
- ☆16Updated last month
- challenges 2024 woohoo☆22Updated last year
- Code for "Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA"☆15Updated 2 months ago
- Official source code and writeups of *CTF2022☆75Updated 3 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆120Updated 11 months ago
- D3CTF-2022-Official-Writeup☆16Updated 3 years ago
- Some crypto scripts which is useful in study and ctf☆29Updated 4 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
- Implementation of cryptographic attacks. Mainly reproduction of recent cryptographic papers.☆16Updated last year
- Templates for deploying pwn challenge in ctf☆48Updated 2 years ago
- ☆64Updated 4 years ago
- ☆42Updated 3 years ago
- ☆29Updated 2 years ago
- SUSCTF2022 Official Writeup☆46Updated 3 years ago
- Upload of all challenges from idekCTF 2022☆23Updated 2 years ago