• D.Pharkkavi
• Dr. D. Maruthanayagam

Encryption has come up as a solution and different encryption algorithms play an important role in data security on cloud. Encryption algorithms is used to ensure the security of data in cloud computing. Due to some limitations of existing algorithms, there is need for more efficient methods in implementation for public key cryptosystems. Elliptic Curve Cryptography (ECC) is based on elliptic curves defined over a finite field. Elliptic Curve Cryptography has many features that distinguish it from other cryptosystems, one of which is that it is still relatively new cryptosystem. As such, many improvements in performance have been discovered during the last few years for Galois Field operations both in Polynomial Basis and in Normal Basis. . However, there is still some confusion to the relative performance of these new algorithms and very little examples of practical implementations of these new algorithms. Efficient implementations of the basic arithmetic operations in finite fields GF(2m) are desired for the applications of cryptography and coding theory. The elements in GF(2m) can be represented in various bases. The choice of basis used to represent field elements has a significant impact on the performance of the field arithmetic. The multiplication methods that use polynomial basis representations are very efficient in comparison to the best methods for multiplication using the other basis representations. This paper focuses on user confidentiality protection in cloud computing using enhanced elliptic curve cryptography (ECC) algorithm over Galois Field GF(2m). The Strength of the proposed ECPC algorithm depends on the complexity of computing discrete logarithm in a large prime modulus, and the Galois Field allows mathematical operations to mix up data easily and effectively. The methodology used involves encrypting and decrypting data to ensure user confidentiality protection and security in the cloud. Results show that the performance of ECPC over Galois Field, in two area of evaluation, is better than the other algorithm which is used for comparison purpose.

Cloud Computing, Data Security, ECC, ECDH, ECDSA and ECPC.

"SPACE COMPLEXITY RESEARCH OF CLOUD DATA SECURITY: ELLIPTICAL CURVE AND POLYNOMIAL CRYPTOGRAPHY", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.1-9, June 2019, Available :http://www.jetir.org/papers/JETIR1906P01.pdf

"SPACE COMPLEXITY RESEARCH OF CLOUD DATA SECURITY: ELLIPTICAL CURVE AND POLYNOMIAL CRYPTOGRAPHY", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp1-9, June 2019, Available at : http://www.jetir.org/papers/JETIR1906P01.pdf