D33BaT0 / my-ctf-challengesLinks
my ctf chals
☆11Updated 3 months ago
Alternatives and similar repositories for my-ctf-challenges
Users that are interested in my-ctf-challenges are comparing it to the libraries listed below
Sorting:
- ☆35Updated 2 years ago
- ☆13Updated 3 weeks ago
- ☆22Updated 7 months ago
- Solving linear systems over GF(2) by manipulating bitvectors☆65Updated 6 months ago
- Functions for solving linear inequalities in integers☆56Updated 3 months ago
- ☆59Updated 2 months ago
- Fast lattice reduction using segmentation, multithreading, Seysen reduction and BLAS☆40Updated 3 weeks ago
- ☆34Updated 2 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆118Updated 10 months ago
- A toolkit for cryptanalysis using lattices.☆131Updated last year
- Automated cryptanalysis of substitution permutation network cipher☆32Updated last year
- Revisiting Differential-Linear Attacks via a Boomerang Perspective☆11Updated 2 months ago
- Implementation of cryptographic attacks. Mainly reproduction of recent cryptographic papers.☆15Updated 10 months ago
- ☆99Updated 6 months ago
- Repo for collecting part of my public CTF challenges☆41Updated last year
- 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
- ☆15Updated 2 years ago
- A SageMath implementation of the Castryck-Decru Key Recovery attack on SIDH☆138Updated 2 years ago
- Fast lattice reduction☆216Updated 2 months ago
- Nonce reuse attacks for AEAD ciphers, especially for the the most commonly used `ChaCha20-Poly1305` and `AES-GCM`.☆20Updated 11 months ago
- Coppersmith's method for multivariate polynomials☆186Updated 2 years ago
- CVP "trick" for CTF challenges☆146Updated 2 years ago
- A Sage interface for FGb (Gröbner basis computations)☆39Updated last year
- An implementation of RSA extending Wiener attack☆16Updated 3 years ago
- Representing DES in Z3☆15Updated 2 years ago
- rkm0959 implements stuff☆45Updated 3 years ago
- Code for "Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA"☆15Updated 3 weeks ago
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆41Updated 5 years ago
- ☆44Updated 2 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