🔐 Modulus Math Simulator

Understanding Modular Arithmetic for Cybersecurity

📊 Basic Modulus Calculator

Dividend (a): Modulus (m):

a mod m = remainder when a is divided by m

Enter values and click Calculate

➕ Modular Addition

Number a: Number b: Modulus m:

(a + b) mod m

Enter values and click Calculate

✖️ Modular Multiplication

Number a: Number b: Modulus m:

(a × b) mod m

Enter values and click Calculate

🔢 Modular Exponentiation (Used in RSA)

Base (a): Exponent (e): Modulus (m):

a^e mod m

Enter values and click Calculate

💡 Why This Matters in Cybersecurity:

Modular exponentiation is the foundation of RSA encryption. It's easy to compute a^e mod m, but extremely difficult to reverse (find e given only the result and a).

🎯 Quick Examples to Try

Clock Arithmetic

10 mod 3 = 1

Like hours on a clock

12-Hour Clock

15 mod 12 = 3

3 PM in 24hr format

Day of Week

100 mod 7 = 2

Days cycle every 7

Caesar Cipher

256 mod 26 = 22

Letter positions