cryptoProeasy

weird modulus

spbctf

Task: RSA challenge with a weird modulus n where p and q are extremely close. Solution: Fermat factorization works instantly when |p - q| is small.

$ ls tags/ techniques/
rsafermat_factorizationclose_primes
fermat_factorization
🔒

Permission denied (requires tier.pro)

Sign in to access full writeups

Sign in with GitHub to continue. No email required.

$sign in

$ grep --similar

Similar writeups