ABSTRACT
In this chapter, the notion of public key cryptography is introduced. Then the RSA-scheme introduced by Rivest, Shamir, and Adleman is treated. The security of this scheme is based on factorization problems of integers. We also include illustrations of how another number theoretical problem, known as the discrete logarithm problem, is used and implemented in the public key cryptographic systems today.
