Twelve RSA and Related Cryptanalysis Challenges
Problem 1 – Linear Combination Recovery The flag is split into two parts m1 and m2. We are given a linear relation a * m1 - b * m2 = 1 where the coefficients a and b are known and coprime. Reducing modulo b gives m1 ≡ inverse(a, b) (mod b) Because m1 might be40000 larger than the modulus, we iterate...