cryptolu / primes-backdoorLinks
Prime backdooring procedure to allow fast factorization of semiprimes
☆24Updated 3 years ago
Alternatives and similar repositories for primes-backdoor
Users that are interested in primes-backdoor are comparing it to the libraries listed below
Sorting:
- rkm0959 implements stuff☆45Updated 2 years ago
- Implements Coron's simplification of Coppersmith's algorithm☆42Updated last year
- Some crypto scripts which is useful in study and ctf☆28Updated 3 years ago
- Files and writeups for challenges I authored in BalsnCTF 2022.☆26Updated 2 years ago
- Implements Coron's simplification of Coppersmith's algorithm☆10Updated 8 years ago
- Repo for collecting part of my public CTF challenges☆41Updated last year
- CVP "trick" for CTF challenges☆135Updated last year
- A repository trying to collect things related to LLL☆71Updated 8 months ago
- Complex multiplication based factorization☆38Updated 3 years ago
- ctfs-2020☆17Updated 5 years ago
- ☆66Updated 5 years ago
- Automated cryptanalysis of substitution permutation network cipher☆31Updated 9 months ago
- Homemade implementation of Square Attack against 4 rounds AES☆14Updated 5 years ago
- ☆45Updated 2 weeks ago
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆40Updated 4 years ago
- Solving linear systems over GF(2) by manipulating bitvectors☆42Updated 2 months ago
- ☆26Updated 3 years ago
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆82Updated 4 years ago
- Representing DES in Z3☆15Updated last year
- My CTF challenges, especially cryptography☆25Updated 3 months ago
- Implementation of the ROCA attack☆17Updated 4 years ago
- Implementation of attacks on cryptosystems☆73Updated 4 years ago
- Solutions and Explanations for problems at https://id0-rsa.pub☆14Updated 5 years ago
- ☆37Updated last year
- Cryptography & CTF Writeups☆83Updated 2 years ago
- ☆39Updated 2 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…