Public-key encryption based on Chebyshev polynomials

Abstract

We propose public-key encryption algorithms based on Chebyshev polynomials, which are secure, practical, and can be used for both encryption and digital signature. Software implementation and properties of the algorithms are discussed in detail. We show that our ElGamal-like and RSA-like algorithms (when Chebyshev polynomials are employed) are as secure as the original ElGamal and RSA algorithms. © Birkhäuser Boston (2005).