cryptohard
RBG+
kalmarctf
Task: RSA with LCG exponents, outputs are integer sums of consecutive ciphertexts c_i + c_{i+1}. Solution: polynomial GCD to recover c_0, then extended GCD on coprime exponents to recover message without factoring N.
$ ls tags/ techniques/
lcg_exponent_recurrencepolynomial_gcd_over_znextended_gcd_message_recoverycoprime_exponent_attack
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Create a free account with GitHub to get started.
$ssh [email protected]