cryptoPromedium

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/
rsacontinued_fractionswiener_attacksmall_dlarge_e
wiener_attackcontinued_fraction_expansion
๐Ÿ”’

Permission denied (requires tier.pro)

Sign in to access full writeups

Sign in with GitHub to continue. No email required.

$sign in

$ grep --similar

Similar writeups