cryptoPromedium

Огромные цифры (Huge Numbers)

hackerlab

Task: RSA with unusually large public exponent e (inverse of small d). Solution: Wiener's attack using continued fraction expansion of e/n to recover small private exponent d.

$ ls tags/ techniques/
rsacontinued_fractionswiener_attacksmall_private_exponentlarge_public_exponentconvergents
Wiener's Attack on RSA with small private exponentContinued fraction expansion of e/nConvergent enumeration to recover dVerification via phi(n) factorization check
🔒

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