Search for a tool
Modular Exponentiation

Tool to compute modular power. Modular Exponentiation (or power modulo) is the result of the calculus a^b mod n. It is often used in informatics and cryptography.

Results

Modular Exponentiation -

Tag(s) : Mathematics, Arithmetics

dCode and you

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day!
You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Team dCode read all messages and answer them if you leave an email (not published). It is thanks to you that dCode has the best Modular Exponentiation tool. Thank you.

# Modular Exponentiation

## Modular Exponentiation Calculus a^b mod n

Tool to compute modular power. Modular Exponentiation (or power modulo) is the result of the calculus a^b mod n. It is often used in informatics and cryptography.

### How to calculate a raised to power b modulo n?

It consists in an exponentiation followed by a modulus, but it exists optimized algorithms with big numbers to return a fast result without having to actually perform the calculation (called fast, thanks to mathematical simplifications).

Example: $$12^{34} \equiv 16 \mod 56$$

Power indicates the name of the operation, and Exponent to indicate the operand.

### What it the algorithm of powmod?

There are several algorithms, here is the simplest in pseudocode:function powmod(base b, exponent e, modulus m) if m = 1 then return 0 var c := 1 for var a from 1 to e c := (c * b) mod m end for return c

### How to solve for exponent with base and modulo?

This calculation is known as the discrete logarithm problem. Some solutions can be found by brute force but there is no simple general solution.

### Why modular exponentiation is limited to integers?

Calculus uses exponent and modulos that are generally defined over the natural number domain set N. It is possible to use rational numbers but it is not handled here.