JL Popyack, October 1997
This guide is intended to help with understanding the workings of the
RSA Public Key Encryption/Decryption scheme. No provisions are made for
high precision arithmetic, nor have the algorithms been encoded for efficiency
when dealing with large numbers.

Step 1. Compute N as the product of two prime numbers p and q:

p

q

Enter values for p and q then click this button:

The values of p and q you provided yield a modulus N, and also a
number r=(p-1)(q-1), which is very important. You will need to find two
numbers e and d whose product is a number equal to 1 mod r.
Below appears a list of some numbers which equal 1 mod r.
You will use this list in Step 2.

N = p*q

r = (p-1)*(q-1)

Candidates (1 mod r):

Step 2. Find a number equal to 1 mod r which can be factored:

K

Enter a candidate value K in the box, then click this button to factor it:

factors of K:

Step 3. Find two numbers e and d
that are relatively prime to N
and for which e*d = 1 mod r:

Use the factorization info above to factor K into two numbers,
e and d.
Click button to check correctness:

e

d

Consistency check:

If your choices of e and d are acceptable, you should see the messages,
"e*d mod r = 1",
"e and r are relatively prime", and "d and r are relatively prime"
at the end of this box.

Step 4. Use e and d to encode and decode messages:

Enter a message (in numeric form) here. Click button to encode.
Break your message into small chunks so that the "Msg" codes are not larger
than N.
(See ASCII Code Chart for ASCII code equivalences.)