cryptomedium
ChristmasRSA
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.
$ ls tags/ techniques/
tonelli_shanksmodular_square_rootprime_factorization_check
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Create a free account with GitHub, then upgrade to Pro.
$ssh [email protected]