Math
Modular Exponentiation Calculator
Compute base^exponent mod modulus with BigInt square-and-multiply. Useful for understanding RSA-style operations (educational).
Free to use — no sign-up or login.
Runs entirely in your browser; input is not sent to our servers.
Messages, keys, passwords, plaintext, ciphertext, and files are never stored in
localStorage, history, or analytics payloads.
Integer base; up to 256 digits.
Non-negative integer exponent; up to 256 digits.
Non-zero modulus; up to 256 digits.
a^e mod m
This free Modular Exponentiation Calculator covers Compute base^exponent mod modulus with BigInt square-and-multiply. Useful for understanding RSA-style operations (educational).
Enter the Modular Exponentiation Calculator fields, then read the output. Math calculators on this site keep the formula visible beside the form, with no account required.
Using the Modular Exponentiation Calculator
Compute base^exponent mod modulus with BigInt square-and-multiply. Useful for understanding RSA-style operations (educational). Typical inputs are Base (a), Exponent (e) and Modulus (m). How it works beside the form states the identity the Modular Exponentiation Calculator applies.
FAQ
How do I use the Modular Exponentiation Calculator?
Open the Modular Exponentiation Calculator, fill Base (a), Exponent (e) and Modulus (m), and read the result. Enter base a, exponent e, and modulus m (non-zero). Related tools: Extended GCD / Modular Inverse and Toy RSA Demonstrator.
What formula does the Modular Exponentiation Calculator use?
The Modular Exponentiation Calculator uses the identity in How it works. In words: Enter base a, exponent e, and modulus m (non-zero). Related tools: Extended GCD / Modular Inverse and Toy RSA Demonstrator.