RSA Calculator

🔢 Primes

🔐 Modulus

📊 Totient

🔑 Public

🔒 Private

💬 Crypto

🔢 Prime Generation

Generate primes: p, q

p:

q:

🔐 Modulus Calculation

n = p × q

p:

q:

n:

📊 Euler's Totient

φ(n) = (p-1) × (q-1)

p:

q:

φ:

🔑 Public Key

gcd(e, φ(n)) = 1

φ:

e:

🔒 Private Key

d × e ≡ 1 (mod φ(n))

e:

φ:

d:

💬 Encrypt/Decrypt

c = m^e mod n | m = c^d mod n

n:

e:

d:

Encryption

Decryption