Abstract
Based on Chebyshev polynomials, you can create an asymmetric cryptosystem that allows secure communication. Such a cryptosystem uses the fact that these polynomials form a semi-group due to the composition operation. This article presents new cryptosystems that use other than semi-group property dependencies. Based on these dependencies as well as modifications of Chebyshev's polynomials, two cryptosystems have been proposed. 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 faster calculation of Chebyshev polynomials.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
