cryptoPromedium

Bread 2

spbctf

Task: RSA with p, q, e given directly. Solution: Use Carmichael's function λ(n) instead of Euler's φ(n) to compute d when gcd(p-1, q-1) > 1.

$ ls tags/ techniques/
rsaeuler_totientcarmichael_functionlambda
modular_inversecarmichael_vs_euler
🔒

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