DocumentCode
259470
Title
Public Key Cryptosystems Using Chebyshev Polynomials Based on Edge Information
Author
Vairachilai, S. ; Kavithadevi, M.K. ; Gnanajeyaraman, R.
Author_Institution
Dept. of Comput. Sci. & Eng., NPR Coll. of Eng. & Technol., Dindigul, India
fYear
2014
fDate
Feb. 27 2014-March 1 2014
Firstpage
243
Lastpage
245
Abstract
Confidential information exchange electronically in a secure way becomes very important in the age of computers. A newly proposed public key crypto method based on Chebyshev polynomials [16] recommend a new approach to data encryption. This paper provides an overview of three major types of public key cryptosystems mainly Diffie-Hellman Key Exchange Algorithm, the RSA Cryptosystem, the ElGamal Encryption Method and their implementation using Chebyshev Polynomials. During the past decade, there has been tremendous interest world-wide image encryption which is based on edge detail. In this method the image divided into two, one is the image contains edges and another is the image without edges, and encrypt the both images using encryption algorithm. The encrypted images are complex for intruder to decode, so it provides a high level of security.
Keywords
image coding; public key cryptography; Chebyshev polynomials; Diffie-Hellman key exchange algorithm; ElGamal encryption method; RSA cryptosystem; computers; confidential information exchange; data encryption; edge detail; edge information; public key cryptosystems; world-wide image encryption; Chebyshev approximation; Encryption; Histograms; Image edge detection; Public key cryptography; Chebyshev Polynomials; Diffie-Hellman Key Exchange Protocol; edge information; the ElGamal Encryption; the RSA Cryptosystem;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Communication Technologies (WCCCT), 2014 World Congress on
Conference_Location
Trichirappalli
Print_ISBN
978-1-4799-2876-7
Type
conf
DOI
10.1109/WCCCT.2014.21
Filename
6755150
Link To Document