RSA Cryptography Visualizer

RSA Cryptography Visualizer

A simple demonstration of RSA encryption concepts

Key Generation

Prime p (small):

Prime q (small):

Public Key

n (modulus):

e (exponent):

Private Key

n (modulus):

d (exponent):

Encryption & Decryption

Message (number):

Encrypted Message:

Decrypted Message:

Process Visualization

Generate keys first to see the visualization

How RSA Works

1. Choose two distinct prime numbers (p and q)
2. Calculate n = p × q (the modulus)
3. Calculate φ(n) = (p-1)(q-1)
4. Choose e (public exponent) that is coprime with φ(n)
5. Calculate d (private exponent) as e⁻¹ mod φ(n)
6. Public key is (n, e), private key is (n, d)
7. Encryption: c = mᵉ mod n
8. Decryption: m = cᵈ mod n

Note: This is a simplified demonstration using small numbers. Real RSA uses primes with hundreds of digits.