This paper reviews the most popular mathematical primitives that are used in current attempts to build secure networks. It sketches a possible security application on the Internet, and shows some of the basic concepts and set the stage for the mathematical primitives that are presented. The factoring and discrete logarithm problems are considered. No attempts are made to formalize notions such as “infeasible”, “hard” or “efficient&rdquo