Application of modified chebyshev polynomials in asymmetric cryptography

Based on Chebyshov polynomials, one can create an asymmetric cryptosystem that allows for secure communication. Such a cryptosystem is based on the fact that these polynomials form a semi-group due to the composition operation. This article presents two new cryptosystems based on modifications of Chebyshev's polynomials. The presented analysis shows that their security is the same as in the case of algorithms associated with the problem of discrete logarithms. The article also shows methods that allow for the faster calculation of Chebyshev polynomials.