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.
3. Explain why this means that we can use the RSA also if gcd(a,
n) 6= 1 mod n.
exercise shows that we can use the RSA even if gcd(a, n) 6= 1 mod
n.
3. Explain why this means that we can use the RSA also if gcd(a,
n) 6= 1 mod n.