VLSI Implementation of RSA Cryptography using Fractional Chebyshev Polynomials Dr. Chitra S. Hema*, Yogeshwaran R.** *Assistant Professor, PSG College of Technology, India. shc@ece.psgtech.ac.in **PG Student, PSG College of Technology, Coimbatore, India. rjyogesh93@gmail.com Online published on 23 March, 2017. Abstract Chebyshev polynomials (CP) are the best approximation polynomials which are purposely used in RSA cryptography to increase the security of data transfer. The Fractional Chebyshev Polynomials (FCP) are derived from Chebyshev polynomials. FCP inherits all the properties of Chebyshev polynomials and possesses some additional orthogonal properties. In this paper, FCP based on CP is introduced for RSA encryption. CP has the disadvantage of discrete log problem. To overcome this problem, monomial xn is replaced with the Fractional Chebyshev polynomial Tn(x). It has been recommended that the safe size of the key space for any cryptosystem based on CP must be chosen such that p greater than 256. For such key size p, normal CP calculation speed will be slow and impractical. Thus, there is a need to improve the Chebyshev polynomial model in mainstream cryptosystems. The security of RSA algorithm could be increased by this proposed approach. This paper compares monomial, Chebyshev and Fractional Chebyshev polynomial based RSA algorithm with the primary factors such as area and encryption time. Top Keywords Chebyshev polynomials, Fractional Chebyshev polynomials, RSA algorithm, HDL. Top |