Click and drag the given steps to their corresponding step names to find 11644 m

Question

Click and drag the given steps to their corresponding step names to find 11644 mod 645 using the given algorithm. procedure modular exponentiation(b: integer, n = (ak-lak-2_a1a0/2, m: positive integers) x:= 1 power:= b mod m for i := 0 to k-1 if a,-1 then x := (x-power) mod m power:= (power , power) mod m returns x (x equals b mod m Step 1 Therefore, 11644 mod 645 can be calculated by first calculating 402 51 mod 645 507 and then 507, 446 mod 645 = 1 114 mod 645-451, 11128 mod 645 121, 11512 mod 645 226 Step 2 Therefore, 11644 mod 645 can be calculated by first calculating 451 121 mod 645 391, and then 391 . 226 mod 645 1 116 mod 645-402, 11129 mod 645 51, 11509 mod 645-446 Step 3 11644 mod 645-116 mod 645 x 11129 mod 64511509 mod 645 reducing modulo 645 at each step 11644 mod 645 114 mod 645 x 11128 mod 645 x 11512 mod 645 reducing modulo 645 at each step

Explanation / Answer

Let RHS step be numbered from a to f .

Therefore,

Step 1 = f

Step 2 = b

Step 3 = c

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.