$ cat writeup.md…
$ cat writeup.md…
levelupctf
Task: an archive API exposes two RSA ciphertexts of the same message under one modulus with different exponents. Solution: classic RSA common-modulus attack via extended Euclid, yielding m = c1^a * c2^b mod n.
Permission denied (requires tier.pro)
Sign in with GitHub, Discord, or Google to continue. No email required.
$sign in$ grep --similar