The length of this binary term is 4, so this is how many steps we will take for our algorithm below
Step 2: Construct Successive Squaring Algorithm:
i
a
a2
a2 mod p
0
11
11
11 mod 53 = 11
1
11
121
121 mod 53 = 15
2
15
225
225 mod 53 = 13
3
13
169
169 mod 53 = 10
Step 3: Review red entries
Look at the binary term with values of 1 in red
This signifies which terms we use for expansion:
Final Answer
10 x 13 x 11 = 1430 mod 53 = 52
You have 2 free calculationss remaining
What is the Answer?
10 x 13 x 11 = 1430 mod 53 = 52
How does the Modular Exponentiation and Successive Squaring Calculator work?
Free Modular Exponentiation and Successive Squaring Calculator - Solves xn mod p using the following methods:
* Modular Exponentiation
* Successive Squaring This calculator has 1 input.
What 1 formula is used for the Modular Exponentiation and Successive Squaring Calculator?
Successive Squaring I = number of digits in binary form of n. Run this many loops of a2 mod p