$ cat writeup.md…
$ cat writeup.md…
grodno_new_year_2026
Task: Non-standard RSA challenge where the modulus n is a prime number and the encryption exponent e=4. Solution: Computed the 4th root of the ciphertext modulo the prime using two successive applications of the Tonelli-Shanks square root algorithm, then checked which of the four roots decoded to a valid flag.
Permission denied (requires tier.pro)
Sign in with GitHub, Discord, or Google to continue. No email required.
$sign in$ grep --similar