How it works
Compute base^exponent mod modulus using exponentiation by squaring with exact BigInt integer arithmetic.
Input definitions
- Integer base
- Enter the value in the labeled unit.
- Nonnegative integer exponent
- Enter the value in the labeled unit.
- Positive integer modulus
- Enter the value in the labeled unit.
A worked example
- Integer base
- 7
- Nonnegative integer exponent
- 13
- Positive integer modulus
- 11
Assumptions & limits
Uses the units and scope stated in the input labels. Results are rounded for display; verify the model is appropriate for your situation.
Sources & review
Maintained by AnsRio. Methods and examples use automated checks; this does not imply independent professional certification.
Method updated 2026-10-18. Content checked against the stated method and examples. Our verification approach.
Common questions
Is this suitable for private cryptographic keys?
No. The algorithm is educational and is not constant time. Use an audited cryptographic library for security-sensitive operations.
How does Modular exponentiation work?
Compute base^exponent mod modulus using exponentiation by squaring with exact BigInt integer arithmetic.
What should I check before using Modular exponentiation?
Uses the units and scope stated in the input labels. Results are rounded for display; verify the model is appropriate for your situation.