Past exam of the mathematics course of the University of Cambridge 2024 ii Paper 2 12K b ii Solution Created 2026-09-24 Updated 2026-09-25
Let the intercepted ciphertexts beSince , the extended Euclidean algorithm gives integers with . The common-modulus RSA attack recoversNegative powers are evaluated using modular inverses. If an inverse does not exist, its greatest common divisor with already factors the modulus.