thomasperrot / aes-square-attackLinks
Homemade implementation of Square Attack against 4 rounds AES
☆15Updated 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:
- Implements Coron's simplification of Coppersmith's algorithm☆42Updated 2 years ago
- ☆35Updated 2 years ago
- Complex multiplication based factorization☆40Updated 3 years ago
- Prime backdooring procedure to allow fast factorization of semiprimes☆24Updated 4 years ago
- Repo for collecting part of my public CTF challenges☆41Updated last year
- my ctf chals☆11Updated 5 months ago
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆40Updated 5 years ago
- ☆64Updated last month
- Solving linear systems over GF(2) by manipulating bitvectors☆73Updated 2 weeks 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
- ☆22Updated 9 months ago
- Some crypto scripts which is useful in study and ctf☆29Updated 4 years ago
- rkm0959 implements stuff☆45Updated 3 years ago
- Automated cryptanalysis of substitution permutation network cipher☆32Updated last year
- 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
- ☆16Updated last month
- Implements Coron's simplification of Coppersmith's algorithm☆10Updated 8 years ago
- A SageMath implementation of the Castryck-Decru Key Recovery attack on SIDH☆135Updated 2 years ago
- Functions for solving linear inequalities in integers☆57Updated 4 months ago
- CVP "trick" for CTF challenges☆149Updated 2 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆121Updated 11 months 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
- ☆68Updated 5 years ago
- Fast lattice reduction using segmentation, multithreading, Seysen reduction and BLAS☆42Updated last month
- A Sage interface for FGb (Gröbner basis computations)☆39Updated last year
- Cryptographic algorithm implementation☆50Updated 2 years ago
- Representing DES in Z3☆16Updated 2 years ago
- Collections of all CTF challenges made by me.☆19Updated last year
- Coppersmith's method for multivariate polynomials☆189Updated 2 years ago