Skip to main content
Log in

Public-Key Encryption Based on Chebyshev Polynomials

  • Published:
Circuits, Systems and Signal Processing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to L. Kocarev, J. Makraduli or P. Amato.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-005-2403-x

Keywords

Navigation