Martin Ouwehand

One of the nice things of the *RSA*
(Rivest, Adleman and Shamir) encryption
system is that the mathematics behind it is relatively
simple: an undergraduate student
should have no problems understanding how it works.
Yet, concise but complete descriptions of **RSA**
are difficult to find on the *WWW*. It is the purpose
of this short note to fill that need
(it is also available in
latex format,
PostScript format
or
PDF format).

- Prerequisites and notation
- Fermat's little theorem and Euler's theorem
**RSA**: the algorithm

- About this document ...

Martin Ouwehand 2001-07-19 | Legal notice |