Let Bobs encryption function be E.M / D Me mod n where n D pq for distinct primes p and
Chapter 46, Problem 46.7(choose chapter or problem)
Let Bobs encryption function be E.M / D Me mod n where n D pq for distinct primes p and q. His decryption function is D.N / D Nd mod n where ed 1 .mod '.n//. Suppose Alice forms a message M (with 1 M < n) that is not relatively prime to n. You may suppose that M is a multiple of p, but not of q. Prove that D.E.M // D M.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer