Circuits, Systems and Signal Processing

, Volume 24, Issue 5, pp 497–517 | Cite as

Public-Key Encryption Based on Chebyshev Polynomials

  • L. KocarevEmail author
  • J. MakraduliEmail author
  • P. AmatoEmail author


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.


Digital Signature Chebyshev Polynomial Encryption Algorithm Software Implementation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhauser Boston 2005

Authors and Affiliations

  1. 1.Institute for Nonlinear Science, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0402USA
  2. 2.Faculty of Electrical Engineering, Karpos II, SkopjeMacedonia
  3. 3.STMicroelectronics, Soft Computing, Si-Optics and Post Silicon Technology, Corporate RandD Via Remo De Feo 1, 80022 Arzano (Napoli)Italy

Personalised recommendations