RSA

This is an implementation of the RSA cryptosystem.

You may enter values for p and q, and they are tested for primeness.
To generate p and q, go to the Random prime number generator page.

Prime p:

Prime q:

The exponent e:

Key: n=pq=

gcd(e,lambda)=

lambda=

Exponent for decryption: d =

Write your text and then press the encode button.

The input as groups of Unicode values:

Each number (group) encoded using RSA.

Each number from above decoded using RSA:

The decoded text: