kp328

19.12.2019 • 

Mathematics

Suppose that (n, e) is an rsa encryption key, with n = pq, where p and q are large primes and gcd(e, (p − 1)(q − 1)) = 1. furthermore, suppose that d is an inverse of e modulo (p − 1)(q − 1). suppose that c ≡ me (mod pq). in the text we showed that rsa decryption, that is, the congruence cd ≡ m (mod pq) holds when gcd(m, pq) = 1. show that this decryption congruence also holds when gcd(m, pq) > 1. [hint: use congruences modulo p and modulo q and apply the chinese remainder theorem.]

Ответ:

hannahmayline

12.02.2020

Mathematics

---

The trigonometric values for cos are C = A/H, which means that to find cos(60), you need to divide the adjacent side by the hypotenuse, which in this case gives you 1/2, so that is the value of cos(60).

I hope this helps!

---

0,0(0 оценок)