Modular Exponentiation Calculator

📋

Walk-through

How to Use This Calculator

3 steps

1

Enter base, exponent, and modulus

Type whole numbers for base (a), exponent (b), and modulus (m). All three fields accept arbitrarily large integers — the calculator uses BigInt internally, so results stay exact even past JavaScript's normal 2^53 safe-integer limit. The base can be negative; it's automatically normalized into the range [0, m).

2

Read the result

The Result tab shows a^b mod m the instant all three fields are filled in. The detail line restates the calculation in plain terms — for example, "4^13 mod 497 = 445."

3

Inspect the algorithm

Switch to the Square-and-Multiply Steps tab to see exactly how the fast exponentiation algorithm reaches that answer, one bit of the exponent at a time. The Binary Exponent tab shows the exponent's binary expansion that drives those steps, plus how many squarings and multiplications it took.

⚡

Reference

Formula & Methodology

1 formula

Square-and-multiply (binary exponentiation)

result = a^b mod m, computed by scanning b's binary digits left to right

Start with result = 1. For each bit of b (most significant first): square the result and reduce mod m; if the bit is 1, also multiply the result by a and reduce mod m again. After the last bit, result equals a^b mod m. Because the number of bits in b is about log2(b), this takes roughly log2(b) squarings and at most log2(b) multiplications — dramatically fewer than the b−1 multiplications a naive "multiply a by itself b times" approach would need, and every intermediate value stays below m instead of growing to a^b before reduction.

📖

Glossary

Key Terms Explained

7 terms

Modular exponentiation Computing a^b mod m — the remainder when a raised to the power b is divided by m. It's the core operation behind RSA encryption, Diffie-Hellman key exchange, and many primality tests.

Square-and-multiply An algorithm for modular exponentiation that scans the exponent's binary digits and, for each one, squares a running result (and multiplies by the base on a 1-bit), reducing modulo m after every operation. Also called fast or binary exponentiation.

Binary exponentiation Another name for square-and-multiply, emphasizing that the algorithm is driven by the exponent's base-2 (binary) representation rather than counting down from b to 0.

Modulus The divisor m in a mod m. The result of modular exponentiation is always an integer in the range [0, m). A modulus of 1 forces every result to 0, since everything is divisible by 1.

BigInt JavaScript's arbitrary-precision integer type. Regular JavaScript numbers lose precision past 2^53 (about 9 quadrillion); BigInt has no such ceiling, which is essential for cryptography-sized bases, exponents, and moduli that can run to dozens or hundreds of digits.

Fast exponentiation A synonym for square-and-multiply / binary exponentiation, contrasted with the naive O(b) approach of repeated multiplication. Fast exponentiation runs in O(log b) multiplications.

RSA A public-key cryptosystem whose encryption and decryption operations are both modular exponentiations: ciphertext = message^e mod n to encrypt, message = ciphertext^d mod n to decrypt. Real RSA keys use moduli hundreds of digits long, which is exactly why fast, BigInt-safe modular exponentiation matters.

👥

Scenarios

Real-World Examples

3 worked examples

🧮

Hand-checkable case

4^13 mod 497

Base (a) 4 Exponent (b) 13 Modulus (m) 497

13 in binary is 1101 — four bits, so the algorithm runs four squarings and three multiplications (one per 1-bit). The running result goes 1 → 4 → 16 → 65 (after multiplying) → 79 → 445 (after the final multiply), landing on 445. You can verify it directly too: 4^13 = 67,108,864, and 67,108,864 divided by 497 leaves a remainder of 445.

🔐

Textbook RSA encryption

65^17 mod 3233

Base (a) 65 Exponent (b) 17 Modulus (m) 3233

This is the classic worked example from RSA's original description: n = 3233 comes from two small primes (61 and 53), the public exponent is 17, and encrypting the message 65 gives the ciphertext 2790. Real RSA keys use a modulus hundreds of digits long instead of a 4-digit toy example, but the operation — modular exponentiation — is identical, which is why the calculator uses BigInt throughout rather than ordinary numbers.

⚠️

Edge case

Any base and exponent, modulus = 1

Base (a) 123456789 Exponent (b) 999999 Modulus (m) 1

Every integer is congruent to 0 modulo 1, so a^b mod 1 is always 0 no matter what a and b are. The Square-and-Multiply Steps tab shows no steps in this case, since there's nothing to compute — the answer is fixed.

📄

Deep Dive

Understanding Modular Exponentiation

3 chapters · 4 min read

Modular exponentiation — computing a^b mod m — looks like a simple arithmetic exercise, but computing it efficiently is what makes modern public-key cryptography practical. This calculator computes a^b mod m using the square-and-multiply algorithm and shows exactly how it works, bit by bit.

Why not just compute a^b and then take the remainder?

For small numbers, computing a^b directly and then reducing mod m works fine. But cryptographic operations use exponents and moduli hundreds of digits long — a^b itself would have far more digits than atoms in the observable universe, long before you ever get to the "mod m" step. Square-and-multiply avoids this entirely by reducing modulo m after every squaring and multiplication, so no intermediate value ever exceeds m. Combined with the fact that it needs only about log2(b) multiplications instead of b − 1, this is what makes operations like RSA encryption with a 2048-bit exponent complete in milliseconds rather than being computationally impossible.

Reading the Square-and-Multiply Steps and Binary Exponent tabs

The algorithm scans the exponent's binary digits from most significant to least significant. At every bit, it squares the running result and reduces mod m; if that bit is a 1, it also multiplies by the base and reduces again. The Binary Exponent tab shows which bits are 1 and which are 0 — each 1-bit is one extra multiplication beyond the squarings every bit requires. A 20-bit exponent, however large the decimal number it represents, still only costs 20 squarings and at most 20 multiplications.

Limits and edge cases

This calculator only supports non-negative exponents. A negative exponent — such as a^(-1) mod m — requires computing a's modular inverse, which only exists when a and m are coprime and needs a different algorithm (the extended Euclidean algorithm) entirely; it isn't supported here. A modulus of 1 always produces 0, since every integer is divisible by 1. And while the base can be entered as negative, it's normalized into the range [0, m) before the algorithm runs, matching the standard mathematical convention that a mod m is always non-negative.

❓

Questions

Frequently Asked Questions

6 questions

What formula does the Modular Exponentiation Calculator use?+

It computes a^b mod m using square-and-multiply: starting from a result of 1, it scans the exponent b's binary digits from most significant to least significant, squaring the running result at every bit and reducing mod m, and additionally multiplying by the base (then reducing mod m again) whenever that bit is 1.

Why is square-and-multiply faster than the obvious approach?+

Multiplying a by itself b − 1 times takes O(b) multiplications — for a 100-digit exponent, that's an astronomically large number of steps. Square-and-multiply instead needs only about log2(b) squarings (plus up to that many multiplications), so a 100-digit exponent takes only a few hundred operations. That's the difference between milliseconds and something that would never finish.

Why does this calculator need BigInt instead of regular numbers?+

JavaScript's regular numbers lose precision past 2^53 (about 9 quadrillion). Cryptographic bases, exponents, and moduli routinely run to dozens or hundreds of digits — far beyond that limit. BigInt has no upper bound on precision, so every field, intermediate value, and result stays exact no matter how large the inputs are.

Where is modular exponentiation actually used?+

It's the core operation in RSA encryption and decryption (ciphertext = message^e mod n), Diffie-Hellman key exchange, digital signatures, and several primality tests such as Fermat's and Miller-Rabin. Any time you use HTTPS, you're relying on fast modular exponentiation happening behind the scenes.

Can I enter a negative exponent?+

No — a negative exponent would require computing the base's modular inverse first (which only exists when the base and modulus are coprime), and that uses a different algorithm entirely. This calculator flags negative exponents rather than silently producing a wrong or misleading answer.

What happens if I set the modulus to 1?+

The result is always 0, regardless of the base or exponent — every integer is congruent to 0 modulo 1 by definition. The calculator short-circuits to this answer directly rather than running the algorithm.

Download a one-page PDF of your numbers instantly. Add your email to also get our occasional calculator tips — no spam, unsubscribe anytime. Privacy.

Modular Exponentiation Calculator

Inputs

Result

How square-and-multiply works

Exponent in binary

How to Use This Calculator

Enter base, exponent, and modulus

Read the result

Inspect the algorithm

Formula & Methodology

Key Terms Explained

Real-World Examples

Hand-checkable case

Textbook RSA encryption

Edge case

Understanding Modular Exponentiation

Why not just compute a^b and then take the remainder?

Reading the Square-and-Multiply Steps and Binary Exponent tabs

Limits and edge cases

Frequently Asked Questions

Get a branded PDF of your results

Modular Exponentiation Calculator

Inputs

Result

How square-and-multiply works

Exponent in binary

Related Calculators

How to Use This Calculator

Enter base, exponent, and modulus

Read the result

Inspect the algorithm

Formula & Methodology

Key Terms Explained

Real-World Examples

Understanding Modular Exponentiation

Why not just compute a^b and then take the remainder?

Reading the Square-and-Multiply Steps and Binary Exponent tabs

Limits and edge cases

Frequently Asked Questions

Get a branded PDF of your results

Keep Exploring

Related calculators

Guides & articles