RSA

A trap door system.

Ronald Rivest, Adi Shamir, and Leonard Adleman, 1977.

Setup:

Pick two primes p and q.

Compute n = p q.

Pick encryption exponent e such that e and (p-1)(q-1) don't have any common prime factors.

Make n and e public.  Keep p and q private.

Example:

[Graphics:Images/index_gr_1.gif]
[Graphics:Images/index_gr_2.gif]
[Graphics:Images/index_gr_3.gif]
[Graphics:Images/index_gr_4.gif]
[Graphics:Images/index_gr_5.gif]
[Graphics:Images/index_gr_6.gif]
[Graphics:Images/index_gr_7.gif]
[Graphics:Images/index_gr_8.gif]

Next Section


Converted by Mathematica      March 17, 2001