Question : Let n = pq for two different primes p and q. This exercise shows that we can use the RSA even if gcd(M, n) 6=
Posted: Thu May 12, 2022 3:51 pm
Question : Let n = pq for two different primes p and q. This
exercise shows that we can use the RSA even if gcd(M, n) 6= 1 (M is
a message).
1. Let j be a multiple of Φ(n). Show that for M such that gcd(M,
n) 6= 1, Mj+1 = M mod p and Mj+1 = M mod q
exercise shows that we can use the RSA even if gcd(M, n) 6= 1 (M is
a message).
1. Let j be a multiple of Φ(n). Show that for M such that gcd(M,
n) 6= 1, Mj+1 = M mod p and Mj+1 = M mod q