cryptomedium
xponent
spbctf
Task: RSA encryption with unusually large public exponent e (close to n). Solution: Wiener's attack using continued fraction expansion of e/n to recover small private exponent d.
$ ls tags/ techniques/
wiener_attackcontinued_fraction_expansion
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Create a free account with GitHub, then upgrade to Pro.
$ssh [email protected]