By Topic

Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Prasadh, K. ; Dept. of CSE, Vinayaka Missions Univ., Salem, India ; Ramar, K. ; Araman, R.G.

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. We discuss the algorithm for textual data and present the cryptanalysis which can be performed on this algorithm for the recovery of encrypted data. We also describe a simple hashing algorithm for making this algorithm more secure, and which can also be used for digital signature. 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.

Published in:

Advances in Recent Technologies in Communication and Computing, 2009. ARTCom '09. International Conference on

Date of Conference:

27-28 Oct. 2009