Square and Multiply Algorithm (1) # Goal: Compute ar (mod n) 1. convert e to binary: ksks 1..kiko 2. b 1; 3. for (i-s o ) 4. (b b*b (mod n); 5. if (ki 1) 8. return b; Montgomery Reduction Let R:N be two integers and gcd(N,R):1. For OsTN N is a prime 10. The Montgomery reduction of 25 modulo 109 w.r.t. 128 is (just enter your answer, for example, 6) Enter answer here Square and Multiply Algorithm (1) # Goal: Compute ar (mod n) 1. convert e to binary: ksks 1..kiko 2. b 1; 3. for (i-s o ) 4. (b b*b (mod n); 5. if (ki 1) 8. return b; Montgomery Reduction Let R:N be two integers and gcd(N,R):1. For OsTN N is a prime 10. The Montgomery reduction of 25 modulo 109 w.r.t. 128 is (just enter your answer, for example, 6) Enter answer here