Question : Let n = pq for two different primes p and q. This exercise shows that we can use the RSA even if gcd(a, n) 6=
Posted: Thu May 12, 2022 3:52 pm
Question : Let n = pq for two different primes p and q. This
exercise shows that we can use the RSA even if gcd(a, n) 6= 1 mod
n.
2. Let e and d be the be the encryption and decryption for RSA
modulo n. Show that a e·d = a mod n for any a.
exercise shows that we can use the RSA even if gcd(a, n) 6= 1 mod
n.
2. Let e and d be the be the encryption and decryption for RSA
modulo n. Show that a e·d = a mod n for any a.