Abstract

Cloud computing is being heralded as an important trend in information technology throughout the world. Data security has a major issue in cloud computing environment; it becomes a serious problem due to the data which is stored diversely over the cloud. Data privacy and security are the two main aspects of user’s concern in cloud information technology. Now-a-days, the cloud data security method uses the symmetric encryption and asymmetric encryption algorithms with their strong authentication techniques. In this paper, we discuss and compare the performances for number of existing security techniques used to provide security in the field of cloud computing on the basis of different parameters. It will be useful to enhance the security of data storage in a cloud environment and also to find proposed a novel security algorithm.

Highlights

  • Cloud computing utilizes with an attractive tag line ‘pay-asyou-use’ for attracting users to its great elasticity and scalability of resources at relatively low cost

  • Elliptic Curve Digital Signature Algorithms (ECDSA) Key Generation Signature originator: parkavi parkavi Domain parameters to be used 'EC-prime239v1': Chosen signature algorithm: ECSP-Digital Signature Algorithm (DSA) with hash function SHA-1 Size of message M to be signed: 5 bytes Bit length of c + bit length of d = 477 bits Message m = "INDIA" 00000 49 4E 44 49 41 INDIA Elliptic curve E described through the curve equation: y^2 = x^3 + ax + b : a = 8342353238919216479164875036030888531447659725296 0362792450860609699836 b = 7385252174069924173485960880387817241648609717970 98971891240423363193866 Private key = 1521284887 Public key W=(Wx,Wy) (W is a point on the elliptic curve) of the signature originator: Wx = 1224700832616806964197507145004472595357380527708 5576222307449754331974 Wy = 1368450552316907669838123190207900378191236323047 3532860089313480758778

  • The times for key generation, signature, and verification algorithms have computed with comparable key sizes for RSA, ELLIPTIC CURVE CRYPTOGRAPHY (ECC), Elliptic Curve Diffie Hellman (ECDH) and ECDSA

Read more

Summary

I.INTRODUCTION

Cloud computing utilizes with an attractive tag line ‘pay-asyou-use’ for attracting users to its great elasticity and scalability of resources at relatively low cost. A key is utilized for data encryption and data decryption This supports in securely protecting integrity and confidentiality of data. Due to the increasing demand of security issues in communication channel its essential to improve a new technological development and efficient hardware security module It consists of plaintext and cipher text in the form of integers between 0 to n-1. We will briefly explain how point addition over elliptic curves is done, as this is used for key generation. The algorithms for different parts of ECC are:Key Generation Algorithm Randomly select an integer Apriv. It acts as the private key for A.

Curve Size
ECDH – Elliptic Curve Diffie Hellman
IV.CONCLUSION
V.REFERENCES
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call