y011d4 / factor-from-random-known-bitsView external linksLinks
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 random.
☆19Jul 16, 2021Updated 4 years ago
Alternatives and similar repositories for factor-from-random-known-bits
Users that are interested in factor-from-random-known-bits are comparing it to the libraries listed below
Sorting:
- Python implementation of Wagner's Algorithm for the Generalized Birthday Problem.☆19Aug 15, 2023Updated 2 years ago
- my ctf chals☆11Jul 7, 2025Updated 7 months ago
- ☆23Mar 4, 2025Updated 11 months ago
- ☆66Nov 10, 2025Updated 3 months ago
- ☆15Mar 14, 2023Updated 2 years ago
- My CTF challenges, especially cryptography☆25Mar 4, 2025Updated 11 months ago
- Revisiting Differential-Linear Attacks via a Boomerang Perspective☆11Nov 26, 2025Updated 2 months ago
- An implementation of Dumer's algorithm for Information Set Decoding.☆14Jan 13, 2024Updated 2 years ago
- Functions for solving linear inequalities in integers☆59Jul 27, 2025Updated 6 months ago
- ☆37Sep 18, 2023Updated 2 years ago
- Homemade implementation of Square Attack against 4 rounds AES☆15Feb 2, 2020Updated 6 years ago
- Implementation of known practical attack on some AES variant☆16Apr 3, 2024Updated last year
- ☆16Feb 4, 2026Updated last week
- Repo for collecting part of my public CTF challenges☆42Mar 25, 2024Updated last year
- A SageMath implementation of the Castryck-Decru Key Recovery attack on SIDH☆138Apr 17, 2023Updated 2 years ago
- A pure python tool to implement/exploit the hash length extension attack☆37Aug 14, 2023Updated 2 years ago
- Solving linear systems over GF(2) by manipulating bitvectors☆82Nov 22, 2025Updated 2 months ago
- Fast lattice reduction using segmentation, multithreading, Seysen reduction and BLAS☆48Nov 3, 2025Updated 3 months ago
- Coppersmith method (solving polynomial equation over composite modulus on small bounds)☆123Dec 21, 2024Updated last year
- Given p xor q and n=p*q for two unknown primes p and q, factor n and output p and q.☆22Jan 8, 2017Updated 9 years ago
- Models the mersenne twister used by Python Random as a symbolic program. This allows recovering the state given a few outputs☆100Apr 20, 2021Updated 4 years ago
- We implement the progressive Improved Progressive BKZ with Lattice Sieving presented in https://eprint.iacr.org/2022/1343, one can call i…☆13Feb 14, 2025Updated 11 months ago
- ☆44Feb 28, 2023Updated 2 years ago
- Fast lattice reduction☆228Aug 25, 2025Updated 5 months ago
- A toolkit for cryptanalysis using lattices.☆137Dec 2, 2023Updated 2 years ago
- Code accompanying the paper "ApresSQI: Extra Fast Verification for SQIsign Using Extension-Field Signing".☆10Mar 30, 2025Updated 10 months ago
- MSIEVE: A Library for Factoring Large Integers☆14Apr 7, 2023Updated 2 years ago
- Implementation of the fastest ISD algorithms☆23Feb 21, 2025Updated 11 months ago
- Toolkit for creating cryptographic figures and videos.☆36May 17, 2024Updated last year
- Automated cryptanalysis of substitution permutation network cipher☆32Aug 27, 2024Updated last year
- ☆35May 26, 2023Updated 2 years ago
- ☆17Aug 15, 2023Updated 2 years ago
- King-of-the-Hill game for the 2nd International Cybersecurity Challenge @ San Diego, California USA☆14Aug 9, 2023Updated 2 years ago
- An implementation of RSA extending Wiener attack☆16Dec 28, 2021Updated 4 years ago
- Final Project in Cryptography - NT219.O11.ATTN☆18Feb 23, 2024Updated last year
- A tool to evaluate the security of cryptographic primitives against distinguishing attacks with bit-vector SMT solvers.☆40Nov 17, 2024Updated last year
- A Cryptographic Library for the Automated Analysis of Symmetric Primitives☆74Updated this week
- ☆42Jun 27, 2022Updated 3 years ago
- Python implementation of a symbolic execution of MT19937 and a solver for GF(2) matrices☆40Aug 1, 2020Updated 5 years ago