basic

Fast Modular Exponentiation Calculator

a^e mod m — core operation in public-key cryptography.

Calculates a^e mod m using repeated squaring. Essential for RSA, Diffie-Hellman, and primality tests. Works for large values where direct exponentiation is impractical.

Marcus Laurent By Marcus Laurent
Published Last reviewed 1 min read

Inputs

Results

Enter values and click Calculate to see results.
Was this helpful?

How to use this calculator

  1. Fill in the inputs above using the units you already have.
  2. Values update automatically as you type — no submit button needed.
  3. Hover any result row for the underlying formula and intermediate values.

Formula

Result = a^e mod m

In depth

Calculates a^e mod m using repeated squaring. Essential for RSA, Diffie-Hellman, and primality tests. Works for large values where direct exponentiation is impractical.