Lydxn / xorsatLinks
☆15Updated last year
Alternatives and similar repositories for xorsat
Users that are interested in xorsat are comparing it to the libraries listed below
Sorting:
- Solving linear systems over GF(2) by manipulating bitvectors☆79Updated 2 months ago
- Implementation of known practical attack on some AES variant☆16Updated last year
- A GDB+GEF-style debugger for unloading Python pickles☆69Updated 6 months ago
- Python implementation of Wagner's Algorithm for the Generalized Birthday Problem.☆19Updated 2 years ago
- ☆66Updated 2 months ago
- Given p xor q and n=p*q for two unknown primes p and q, factor n and output p and q.☆22Updated 9 years ago
- Files and writeups for challenges I authored in BalsnCTF 2022.☆26Updated 3 years ago
- Repo for collecting part of my public CTF challenges☆41Updated last year
- Complex multiplication based factorization☆40Updated 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
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆99Updated 4 years ago
- Some crypto scripts which is useful in study and ctf☆29Updated 4 years ago
- Challenge source code and author write-ups for KalmarCTF☆69Updated 2 weeks ago
- Repository to keep track of python memory corruption bugs that can be used to potentially bypass audit hooks☆64Updated 3 weeks ago
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆40Updated 5 years ago
- Nonce reuse attacks for AEAD ciphers, especially for the the most commonly used `ChaCha20-Poly1305` and `AES-GCM`.☆22Updated last year
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆123Updated last year
- Implementation of cryptographic attacks. Mainly reproduction of recent cryptographic papers.☆15Updated last year
- Predict and Backtrack MT19937 PRNG by putting 32 * 624 bits generated numbers. Python "random" standard library uses mt19937, so we can …☆40Updated 3 years ago
- ☆37Updated 2 years ago
- ☆23Updated 2 years ago
- ☆12Updated 2 years ago
- Prime backdooring procedure to allow fast factorization of semiprimes☆24Updated 4 years ago
- CTF challenges I've written☆35Updated 2 years ago
- CVP "trick" for CTF challenges☆150Updated 2 years ago
- justCTF 2023 challenges sources☆21Updated 2 years ago
- Functions for solving linear inequalities in integers☆59Updated 5 months ago
- Challenges I've made for public CTFs.☆22Updated 3 months ago
- Challenge repository for ACSC 2024☆13Updated last year
- CTF problems I have created.☆14Updated 2 years ago