rkm0959 / Implementations
rkm0959 implements stuff
☆43Updated 2 years ago
Alternatives and similar repositories for Implementations:
Users that are interested in Implementations are comparing it to the libraries listed below
- CVP "trick" for CTF challenges☆130Updated last year
- A repository trying to collect things related to LLL☆71Updated 5 months ago
- Some crypto scripts which is useful in study and ctf☆28Updated 3 years ago
- Automated cryptanalysis of substitution permutation network cipher☆28Updated 5 months ago
- Repo for collecting part of my public CTF challenges☆40Updated 10 months ago
- Cryptography & CTF Writeups☆82Updated last year
- ☆66Updated 4 years ago
- Prime backdooring procedure to allow fast factorization of semiprimes☆22Updated 3 years ago
- ☆43Updated 2 weeks ago
- Solving linear systems over GF(2) by manipulating bitvectors☆33Updated 2 weeks ago
- 🧩 Collection of CTF challenges written by me☆19Updated last year
- Implements Coron's simplification of Coppersmith's algorithm☆42Updated last year
- Coppersmith's method for multivariate polynomials☆158Updated last year
- Complex multiplication based factorization☆35Updated 2 years ago
- My CTF challenges, especially cryptography☆25Updated 2 months ago
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆72Updated 3 years ago
- ☆30Updated last year
- Functions for solving linear inequalities in integers☆45Updated 3 months ago
- Solutions and Explanations for problems at https://id0-rsa.pub☆14Updated 4 years ago
- ☆37Updated last year
- Implements Coron's simplification of Coppersmith's algorithm☆10Updated 7 years ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆99Updated last month
- ☆21Updated last month
- CTF writeups☆13Updated 4 years ago
- Collections of all CTF challenges made by me.☆17Updated 10 months ago
- SMT based attacks on non cryptographic PRNGs☆77Updated 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 3 years ago
- ctfs-2020☆17Updated 4 years ago
- Some writeups for some CTFs☆16Updated 10 months ago
- A toolkit for cryptanalysis using lattices.☆112Updated last year