cryptoPromedium

Весёлый RSA (Funny RSA)

hackerlab

Task: Same message encrypted with RSA for three parties using different small moduli. Solution: Factor the small moduli, find the one where gcd(e, phi(n))=1, decrypt with standard RSA, compute SHA256 hash of message.

$ ls tags/ techniques/
sha256rsasmall_modulusfactorizationbroadcast_attackhastadmulti_recipientsame_message
Small modulus factorization (trial division)Standard RSA decryption with computed private keySHA256 hash computation for flag formatVerification across multiple ciphertexts
🔒

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