MATHEMATICAL FOUNDATIONS OF THE TRANSFER OF THE EL-GAMAL ASYMMETRIC ENCRYPTION ALGORITHM TO ELLIPTIC CURVES

Today, the stability of modern asymmetric algorithms, unlike the stability of symmetric ciphers, is based on certain mathematical problems,.  In particular, the problems of decomposition of the given number into prime multipliers (factorization) and discrete logarithmization in the finite field are recognized as the bases of mathematical complexity.