$ cat writeup.md…
$ cat writeup.md…
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.
Permission denied (requires tier.pro)
Sign in with GitHub, Discord, or Google to continue. No email required.
$sign in$ grep --similar