sliedes / xor_factor
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
Alternatives and similar repositories for xor_factor:
Users that are interested in xor_factor are comparing it to the libraries listed below
- Solving linear systems over GF(2) by manipulating bitvectors☆38Updated last week
- Predict and Backtrack MT19937 PRNG by putting 32 * 624 bits generated numbers. Python "random" standard library uses mt19937, so we can …☆38Updated 2 years ago
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆39Updated 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…☆19Updated 3 years ago
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆78Updated 3 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆102Updated 3 months ago
- Complex multiplication based factorization☆37Updated 3 years ago
- Repo for collecting part of my public CTF challenges☆40Updated last year
- Homemade implementation of Square Attack against 4 rounds AES☆14Updated 5 years ago
- Implements Coron's simplification of Coppersmith's algorithm☆42Updated last year
- Some crypto scripts which is useful in study and ctf☆28Updated 3 years ago
- ☆45Updated last month
- Code for "Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA"☆13Updated 3 months ago
- official writeup for starctf2023☆32Updated last year
- Functions for solving linear inequalities in integers☆45Updated 2 weeks ago
- ☆12Updated 5 years ago
- ☆48Updated last year
- rkm0959 implements stuff☆43Updated 2 years ago
- Nonce reuse attacks for AEAD ciphers, especially for the the most commonly used `ChaCha20-Poly1305` and `AES-GCM`.☆17Updated 5 months ago
- Files and writeups for challenges I authored in BalsnCTF 2022.☆26Updated 2 years ago
- Coppersmith's method for multivariate polynomials☆162Updated last year
- Prime backdooring procedure to allow fast factorization of semiprimes☆22Updated 3 years ago
- ☆32Updated last year
- ☆11Updated last month
- Challenge source code and author write-ups for KalmarCTF☆65Updated 3 weeks ago
- Python sandbox escape wiki + payload generator☆76Updated 7 months ago
- A GDB+GEF-style debugger for unloading Python pickles☆63Updated 3 months ago
- CVP "trick" for CTF challenges☆133Updated last year
- ☆21Updated last month
- SUSCTF2022 Official Writeup☆46Updated 3 years ago