kmyk / mersenne-twister-predictorLinks
Predict MT19937 PRNG, from preceding 624 generated numbers. There is a specialization for the "random" of Python standard library.
☆184Updated 4 years ago
Alternatives and similar repositories for mersenne-twister-predictor
Users that are interested in mersenne-twister-predictor are comparing it to the libraries listed below
Sorting:
- Coppersmith's method for multivariate polynomials☆165Updated last year
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆82Updated 4 years ago
- Repository containing implementation of attacks on modern public key cryptosystems and symmetric key ciphers.☆133Updated last year
- Predict python's random module generated values.☆410Updated 6 months ago
- A Python3 implementation of the Wiener attack on RSA☆119Updated last year
- CVP "trick" for CTF challenges☆135Updated last year
- Pure Python hash length extension module☆125Updated 2 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆104Updated 5 months ago
- Contains tools for solving RSA and other crypto problems in CTFs.☆329Updated 3 years ago
- a fork of primefac(https://pypi.python.org/pypi/primefac) module☆84Updated 10 months ago
- ☆66Updated 5 years ago
- Complex multiplication based factorization☆38Updated 3 years ago
- An nsjail Docker image for CTF pwnables. Easily create secure, isolated xinetd/inetd-style services.☆209Updated 10 months ago
- Small python module for common CTF crypto functions☆167Updated 2 years ago
- SMT based attacks on non cryptographic PRNGs☆81Updated 2 years ago
- A repository trying to collect things related to LLL☆71Updated 8 months ago
- A full English version of the popular ctf-wiki☆94Updated 10 months ago
- Challenges I created for CTF competitions.☆204Updated 2 months ago
- Solving linear systems over GF(2) by manipulating bitvectors☆42Updated 2 months ago
- Working with numbers (primes, modular, etc.)☆243Updated 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
- Given at least 624 outputs of a Mersenne Twister PNRG we can restore its internal state.☆47Updated 9 years ago
- TCP flow analyzer with sugar for A/D CTF☆140Updated 2 years ago
- Cryptography & CTF Writeups☆83Updated 2 years ago
- Implementation of attacks on cryptosystems☆73Updated 4 years ago
- Python library for CTFer☆143Updated last month
- Docker image for attacking cryptography CTF challenges☆100Updated last year
- A toolkit for cryptanalysis using lattices.☆122Updated last year
- Repo for collecting part of my public CTF challenges☆41Updated last year
- Web wrapper of niklasb/libc-database☆204Updated 6 months ago