An Improved Public Key Cryptographic Algorithm Based on Chebyshev Polynomials and RSA

Abstract

Due to its very desirable properties, Chebyshev polynomials are often used in the design of public key cryptographic systems. This paper discretizes the Chebyshev mapping, generalizes the properties of Chebyshev polynomials, and proposes an improved public key encryption algorithm based on Chebyshev chaotic mapping and RSA, i.e., CRPKC−Ki. This algorithm introduces alternative multiplication coefficients Ki, the selection of which is determined by the size of TrTdxmod N=TdTrxmod N, and the specific value selection rules are shared secrets among participants, overcoming the shortcomings of previous schemes. In the key generation and encryption/decryption stages, more complex intermediate processes are used to achieve higher algorithm complexity, making the algorithm more robust against ordinary attacks. The algorithm is also compared with other RSA-based algorithms to demonstrate its effectiveness in terms of performance and security.

Keywords

• public-key cryptosystem
• Chebyshev polynomials
• RSA
• alternative multiplication coefficients
• semi-group property