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) : Arithmetics

Share
Share
dCode and you

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!


Please, check our community Discord for help requests!


Thanks to your feedback and relevant comments, dCode has developped the best Modular Exponentiation tool, so feel free to write! Thank you !

Modular Exponentiation

Sponsored ads

Modular Exponentiation Calculus a^b mod n




a^b mod n Solver

Solver limited to integer solutions < 10000

Find unknown b




Find unknown a




Find unknown n




See also: Equation Solver

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.

Answers to Questions

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 $$

The word power indicates the name of the operation, and exponent to indicate the operand.

How to calculate the last digits of an exponentiation?

Calculating the last $ x $ digits of $ a ^ b $ is equivalent to calculating $ a ^ b \mod n $ with $ n = 10 ^ x $ (the number $ 1 $ followed by $ x $ zeros)

Example: $ 3 ^ 9 = 19683 $ and $ 3 ^ 9 \mod 100 = 83 $ (the last 2 digits)

What is the algorithm of powmod?

There are several algorithms, here is the shortest one in pseudocode:// 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 trivial 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.

Source code

dCode retains ownership of the online 'Modular Exponentiation' tool source code. Except explicit open source licence (indicated CC / Creative Commons / free), any algorithm, applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (PHP, Java, C#, Python, Javascript, Matlab, etc.) no data, script or API access will be for free, same for Modular Exponentiation download for offline use on PC, tablet, iPhone or Android !

Need Help ?

Please, check our community Discord for help requests!

Questions / Comments

Thanks to your feedback and relevant comments, dCode has developped the best Modular Exponentiation tool, so feel free to write! Thank you !


Source : https://www.dcode.fr/modular-exponentiation
© 2020 dCode — The ultimate 'toolkit' to solve every games / riddles / geocaching / CTF.
Feedback