Enter Modular Exponentiation


      

Solve 28 mod 5e27 using:

the Successive Squaring Method

Step 1: Convert our power of to binary notation:

Using our binary calculator, we see that in binary form is

The length of this binary term is 0, so this is how many steps we will take for our algorithm below

Step 2: Construct Successive Squaring Algorithm:

iaa2a2 mod p

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

= 1 mod 5e27 = 1


You have 2 free calculationss remaining




What is the Answer?
= 1 mod 5e27 = 1
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

For more math formulas, check out our Formula Dossier

What 6 concepts are covered in the Modular Exponentiation and Successive Squaring Calculator?

exponent
The power to raise a number
integer
a whole number; a number that is not a fraction
...,-5,-4,-3,-2,-1,0,1,2,3,4,5,...
modular exponentiation
the remainder when an integer b (the base) is raised to the power e (the exponent), and divided by a positive integer m (the modulus)
modulus
the remainder of a division, after one number is divided by another.
a mod b
remainder
The portion of a division operation leftover after dividing two integers
successive squaring
an algorithm to compute in a finite field
Example calculations for the Modular Exponentiation and Successive Squaring Calculator

Modular Exponentiation and Successive Squaring Calculator Video


Tags:



Add This Calculator To Your Website