RSA Calculator

Please enter a prime number >= 2.
Please enter a prime number >= 2.
e must be coprime to φ(n) and 1 < e < φ(n).
Message must be a non-negative integer.
Results
n = p * q: -
φ(n): -
Public key (n, e): -
Private key d: -
Encrypted message: -
Decrypted message: -
Formula: RSA uses modular exponentiation. Encryption: c = m^e mod n. Decryption: m = c^d mod n. d is the modular inverse of e modulo φ(n).