RSA Explorer | Interactive Explorations

K Key Generation

Prime p:

Prime q:

Public exponent e

n = p × q

—

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

—

e (public)

—

d = e^-1 mod φ

—

Key computation steps

Awaiting input...

bits(n)

—

bits(p)

—

bits(q)

—

E Encrypt / Decrypt

Message M:

Ciphertext C

—

Decrypted M'

—

Encryption steps (M^e mod n)

Awaiting encryption...

Decryption steps (C^d mod n)

Awaiting decryption...

Encrypt time

—

Decrypt time

—

A Attack Demonstrations

Small keys (< 16 bits) are trivially broken. Real RSA uses 2048+ bit keys.

Ready. Generate a key pair and press an attack button.

Divisions tested

—

Factor found

—

Attack time

—

Private key d

—