Abstract
In this project a theoretical and practical treatment of the RSA
cryptosystem is considered.
The treatment includes the basis needed from number theory.
Discussion includes, prime numbers, divisibility, the extended
Euclidean algorithm, modular aritlnnetic and the computation of certain
number theoretic fimctions.
. Also the application of cryptography to information is discussed. It
includes the objectives and the mecllanisms.
Special consideration is given to public-key cryptosystems and their
uses in confidentiality.
A program using CH is written to apply the RSA cryptosystem in
encryption.
