thomasperrot / aes-square-attackLinks
Homemade implementation of Square Attack against 4 rounds AES
☆14Updated 5 years ago
Alternatives and similar repositories for aes-square-attack
Users that are interested in aes-square-attack are comparing it to the libraries listed below
Sorting:
- Prime backdooring procedure to allow fast factorization of semiprimes☆24Updated 3 years ago
- Implements Coron's simplification of Coppersmith's algorithm☆42Updated 2 years ago
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆40Updated 5 years ago
- Complex multiplication based factorization☆39Updated 3 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
- 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
- Some crypto scripts which is useful in study and ctf☆29Updated 4 years ago
- Predict and Backtrack MT19937 PRNG by putting 32 * 624 bits generated numbers. Python "random" standard library uses mt19937, so we can …☆40Updated 2 years ago
- Repo for collecting part of my public CTF challenges☆41Updated last year
- Implementation of cryptographic attacks. Mainly reproduction of recent cryptographic papers.☆14Updated 10 months ago
- Solving linear systems over GF(2) by manipulating bitvectors☆57Updated 6 months ago
- ☆35Updated 2 years ago
- ☆13Updated last week
- ☆56Updated last month
- Automated cryptanalysis of substitution permutation network cipher☆32Updated last year
- Implements Coron's simplification of Coppersmith's algorithm☆10Updated 8 years ago
- Cryptographic algorithm implementation☆50Updated 2 years ago
- rkm0959 implements stuff☆44Updated 3 years ago
- ☆22Updated 7 months ago
- Repo for colecting all my public CTF challenges☆28Updated 9 months ago
- my ctf chals☆11Updated 3 months ago
- Nonce reuse attacks for AEAD ciphers, especially for the the most commonly used `ChaCha20-Poly1305` and `AES-GCM`.☆20Updated 11 months ago
- ☆34Updated 3 years ago
- ☆12Updated 5 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆117Updated 9 months ago
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆93Updated 4 years ago
- Implementation of attacks on cryptosystems☆75Updated 2 months ago
- CVP "trick" for CTF challenges☆146Updated 2 years ago
- Functions for solving linear inequalities in integers☆56Updated 2 months ago
- Files and writeups for challenges I authored in BalsnCTF 2022.☆26Updated 3 years ago