1 mod n. Let n = pq. This exercise shows that we can use the RSA...

 

Transcribed Image Text:

1 mod n. Let n = pq. This exercise shows that we can use the RSA even if gcd(a, n) + 1. Let m be a multiple of Þ(n). Show that for a such that ged(a, n) # 1 mod n, am+1 a mod p and am+1 a mod q = 2. Let e and d be the be the encryption and decryption for RSA modulo n. Show that ada mod n for any a. 1 mod n. Let n = pq. This exercise shows that we can use the RSA even if gcd(a, n) + 1. Let m be a multiple of Þ(n). Show that for a such that ged(a, n) # 1 mod n, am+1 a mod p and am+1 a mod q = 2. Let e and d be the be the encryption and decryption for RSA modulo n. Show that ada mod n for any a.