Modular Exponentiation and Successive Squaring Calculator

Modular Exponentiation and Successive Squaring Calculator Image to Crop

Enter Modular Exponentiation

Solve mod using:

Modular exponentiation

Build an algorithm:

n is our exponent =

y = 1 and u ≡ mod =

See here

Because n = 0, we stop

We have our answer

Final Answer

mod ≡ 1

You have 1 free calculations remaining

What is the Answer?

How does the Modular Exponentiation and Successive Squaring Calculator work?

Free Modular Exponentiation and Successive Squaring Calculator - Solves xⁿ 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 a² 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