- 3 Let P 5 Q 11 And E 3 A Compute Pq And P 1 G 1 B Prove That Gcd E P 1 Q 1 1 C Compute The 1 (40.43 KiB) Viewed 24 times
(3) Let p = 5, q = 11, and e = 3. (a) Compute pq and (p-1)(g-1). (b) Prove that gcd(e, (p-1)(q-1)) = 1. (c) Compute the
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
(3) Let p = 5, q = 11, and e = 3. (a) Compute pq and (p-1)(g-1). (b) Prove that gcd(e, (p-1)(q-1)) = 1. (c) Compute the
(3) Let p = 5, q = 11, and e = 3. (a) Compute pq and (p-1)(g-1). (b) Prove that gcd(e, (p-1)(q-1)) = 1. (c) Compute the smallest positive integer d such that de = 1 (mod (p-1)(g-1)) Equivalently, 3d 1 (mod 40) (d) Compute the smallest positive integer r such that 2³ 52 (mod 55).