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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Kocarev, L., Makraduli, J. & Amato, P. Public-Key Encryption Based on Chebyshev Polynomials. Circuits Syst Signal Process 24, 497–517 (2005). https://doi.org/10.1007/s00034-005-2403-x
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00034-005-2403-x