The length of this binary term is 5, 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
28
28
28 mod 76 = 28
1
28
784
784 mod 76 = 24
2
24
576
576 mod 76 = 44
3
44
1936
1936 mod 76 = 36
4
36
1296
1296 mod 76 = 4
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
4 x 36 x 24 x 28 = 96768 mod 76 = 20
You have 2 free calculationss remaining
What is the Answer?
4 x 36 x 24 x 28 = 96768 mod 76 = 20
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