💻
RSA Calculator
Educational RSA encryption and decryption demo with small primes
Formula: Modulus $n = p \cdot q$, Totient $\phi(n) = (p-1)(q-1)$, Ciphertext $c = m^e \pmod n$, Decryption $m' = c^d \pmod n$ (where $d \cdot e \equiv 1 \pmod{\phi(n)}$). Enter small primes $p, q$, public exponent $e$, and message $m$.
RSA Parameters Input
Calculation Results
⚠️ For educational purposes only. Verify results with a qualified professional when making important decisions.