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 11:08 am
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.
4. Explain why is gcd(a, n) = 1 highly likely for a large n = p
ยท q
exercise shows that we can use the RSA even if gcd(a, n) 6= 1 mod
n.
4. Explain why is gcd(a, n) = 1 highly likely for a large n = p
ยท q