cryptomedium
Darling
spbctf
Task: RSA with small exponent e=3 and null-byte padding. Solution: Since m^e < n, modular reduction doesn't occur; remove padding factor algebraically and extract integer cube root with gmpy2.iroot().
$ ls tags/ techniques/
integer_cube_rootrsa_small_exponent_attackknown_padding
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Create a free account with GitHub, then upgrade to Pro.
$ssh [email protected]