Journal of
Engineering and Technology Research

  • Abbreviation: J. Eng. Technol. Res.
  • Language: English
  • ISSN: 2006-9790
  • DOI: 10.5897/JETR
  • Start Year: 2009
  • Published Articles: 198


Public key cryptosystems based on chaotic Chebyshev polynomials

K. Prasadh1, K. Ramar2 and R. Gnanajeyaraman3*
  1Department of CSE, Vinayaka Missions University, Salem, India. 2Department of CSE, National Engineering College, Kovilpatti, India. 3Department of CSE, VMKV Engineering College, Salem, India.
Email: [email protected]

  •  Accepted: 22 July 2009
  •  Published: 31 October 2009



Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption based on chebyshev polynomials by Alfred et al. (1996). We discuss the algorithm for textual data and present the cryptanalysis which can be performed on this algorithm for the recovery of encrypted data by Diffe and Hellman (1976). We also describe a simple hashing algorithm for making this algorithm more secure, and which can also be used for digital signature by Xiao et al. (2007). The main scope of this paper is to propose an extension of this algorithm to images and videos and making it secure using multilevel scrambling and hash. Software implementations and experimental results are also discussed in detail.


Key words: Chaos, public key, hash, Chebyshev map.