RSA Common modulus¶

RootMe Challenge: Arithmetic Power: A message was sent by a company to two of its engineers, but they were negligent in the choice of the keys of its employees. Decrypt the sent message.

Extended GCD algorithm and Bezout’s identity.

Resources¶

• Bézout’s Identity - Theorem of the day

• PGCD PGCM - Théorèmes de Bézout et de Gauss

• Bézout’s identity - euclidean algorithm