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
Alternatives and similar repositories for xor_factor
Users that are interested in xor_factor are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆15Sep 2, 2024Updated 2 years ago
- Homemade implementation of Square Attack against 4 rounds AES☆14Feb 2, 2020Updated 6 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…☆20Jul 16, 2021Updated 5 years ago
- Functions for solving linear inequalities in integers☆62Jul 27, 2025Updated last year
- Implements Coron's simplification of Coppersmith's algorithm☆43Oct 10, 2023Updated 2 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- SCTF 2021☆26Jan 15, 2022Updated 4 years ago
- Revisiting Differential-Linear Attacks via a Boomerang Perspective☆13Nov 26, 2025Updated 9 months ago
- Prime backdooring procedure to allow fast factorization of semiprimes☆25Dec 10, 2021Updated 4 years ago
- ☆28Nov 18, 2021Updated 4 years ago
- Collections of all CTF challenges made by me.☆20Apr 14, 2024Updated 2 years ago
- MSIEVE: A Library for Factoring Large Integers☆17Apr 7, 2023Updated 3 years ago
- Implementation of cryptographic attacks. Mainly reproduction of recent cryptographic papers.