PGP Using Chebyshev Polynomial
IUP Journal Computer Science,India
9 Pages Posted: 20 Apr 2011 Last revised: 16 May 2011
Date Written: December 15, 2009
This paper presents a novel idea of achieving higher degree of privacy for e-mails using Chebyshev polynomials for ‘Pretty Good Privacy (PGP) (Kenneth and Ballou, 2005)’. The strength of polynomials lies in their chaotic properties which are potentially suitable for cryptography. A brief discussion on how these polynomials are helpful in providing good security is presented in this paper and the security strengths are evaluated.
Keywords: Pretty Good Privacy, Chebyshev Polynomials, Encryption, Digital Signature, Private Key Cryptosystem, Public Key Cryptosystem, Compression, Base-64 Encoding
Suggested Citation: Suggested Citation