cryptoProhard

Kiss ASIS

ASIS CTF

Task: break a modified RSA with phi=(p^k-1)(q^k-1) and very large private exponent d. Solution: apply continued fraction expansion on e/N^k for k=1..6 to recover d from convergents, handling both e*d≡1 and e*d≡-1 (mod phi) cases.

$ ls tags/ techniques/
modular_inversersacontinued_fractionslattice_attackmodified_rsawiener_variantlarge_private_exponentgeneralized_wiener
Continued fraction expansion on e/N^kConvergent enumeration for key recoveryHandling e*d ≡ -1 (mod phi) caseModular inverse decryption
🔒

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