Abstract:
Asymmetric cryptosystems are based on the complexity of solving the following three basic problems of mathematics [2-5]:1. Divide an integer that is large enough into prime factors. 2. Discrete logarithm in a finite field. 3. Calculate the roots of a system of linear algebraic equations in a finite area. The solution of each of these problems leads to problems that are complex and difficult, or theoretically proven to be unsolvable, even when today's computing devices are fully utilized.
|