RSA Small

Choose RSA Primes

Check the tiny RSA primes and modulus. This is toy arithmetic only, not deployable security.

Example

Check the tiny RSA primes and modulus. RSA starts from two prime numbers whose product forms the modulus that every encryption and decryption runs through. Confirming that the chosen numbers are genuinely prime and that their product matches the modulus is the foundation the whole scheme rests on, since its security depends on those primes staying secret.

highlighted = computed this step

Step 1 — p prime

Compute the highlighted cryptography value.

p primeTrue\begin{array}{c|c}\text{p prime}&\hlmath{\text{True}}\end{array}

Step 2 — q prime

Compute the highlighted cryptography value.

q primeTrue\begin{array}{c|c}\text{q prime}&\hlmath{\text{True}}\end{array}

Step 3 — Modulus

Compute the highlighted cryptography value.

n=pq55\begin{array}{c|c}\text{n=pq}&\hlmath{\text{55}}\end{array}
cryptography The values in this lesson are deliberately tiny so every modular arithmetic step can be checked exactly.