$ cat writeup.md…
$ cat writeup.md…
ASIS CTF
Task: break a modified RSA with phi=(p^k-1)(q^k-1) and very large private exponent d. Solution: apply continued fraction expansion on e/N^k for k=1..6 to recover d from convergents, handling both e*d≡1 and e*d≡-1 (mod phi) cases.
Permission denied (requires tier.pro)
Sign in with GitHub, Discord, or Google to continue. No email required.
$sign in$ grep --similar