Math
Toy RSA Demonstrator
Walk through tiny RSA with user-provided small primes: n, φ(n), e, d, and encrypt/decrypt steps. Educational only—not production keys.
Free to use — no sign-up or login.
Runs entirely in your browser; input is not sent to our servers.
Messages, keys, passwords, plaintext, ciphertext, and files are never stored in
localStorage, history, or analytics payloads.
Distinct prime ≤ 100,000.
Distinct prime ≤ 100,000.
Must satisfy 1 < e < φ(n) and gcd(e, φ(n)) = 1.
Integer with 0 ≤ m < n.
n = pq
φ(n)
Private d
Ciphertext c
Decrypted m
This free Toy RSA Demonstrator covers Walk through tiny RSA with user-provided small primes: n, φ(n), e, d, and encrypt/decrypt steps. Educational only—not production keys.
Enter the Toy RSA Demonstrator fields, then read the output. Math calculators on this site keep the formula visible beside the form, with no account required.
Using the Toy RSA Demonstrator
Walk through tiny RSA with user-provided small primes: n, φ(n), e, d, and encrypt/decrypt steps. Educational only—not production keys. Typical inputs are Prime p, Prime q, Public exponent e and Message integer m. How it works beside the form states the identity the Toy RSA Demonstrator applies.
FAQ
How do I use the Toy RSA Demonstrator?
Open the Toy RSA Demonstrator, fill Prime p, Prime q, Public exponent e and Message integer m, and read the result. Pick distinct small primes p and q, a public exponent e coprime to φ(n), and a message integer m with 0 ≤ m < n. Related: Modular Exponentiation, Extended GCD / Modular Inverse, Euler Totient.
What formula does the Toy RSA Demonstrator use?
The Toy RSA Demonstrator uses the identity in How it works. In words: Pick distinct small primes p and q, a public exponent e coprime to φ(n), and a message integer m with 0 ≤ m < n. Related: Modular Exponentiation, Extended GCD / Modular Inverse, Euler Totient.