Professional Documents
Culture Documents
Available at http://www.ijcsonline.com/
Abstract
The utilization of cloud based services is growing with a rapid rate, so the need to secure these services is also
growing very rapidly. As the user stores and shares it's data over the cloud, so the data have to be used in the encrypted
structure for which many cryptographic algorithms (symmetric, Asymmetric & Hashing) can be used. These algorithms
use a large amount of resources for the computation purpose and their performances are diverse in diverse
environments. All the cryptographic algorithms face diverse issues based upon their Algorithm and key generation
process. Here in this survey paper we discuss about the various cryptographic approaches to facilitate the purpose of
security in cloud computing. Here we propose a model for storing the data on cloud in secured way. This model will also
enhance the security of stored data.
Keywords: Cryptography, Symmetric, Asymmetric, Hashing, Cloud Computing, Security Model.
I.
INTRODUCTION
127 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 02, February, 2016
Rahul Sharma et al
CRYTOGRAPHY
A. SYMMETRIC ENCRYPTION
It makes the use of a single key to encrypt and decrypt the
data. If we encrypt some file and then decrypt the file
using the same key, we are making use of symmetric
encryption. It can also be called as secret key
128 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 02, February, 2016
Rahul Sharma et al
Key Size
1024-4096
Bits
1024-4096
Bits
Smaller
Key sizes
Security
[9]
Good
Security
Adequate
Security
Excellent
Security
1) MD FAMILY :
Message Digest 2 [11] or MD2 was the first member of
this family developed in 1989, after that MD4 was being
proposed in 1990 based on which MD5 the Message Digest
algorithm 5, shaped by Ronald Rivest. It is also the most
extensively used MD family of hash algorithms. It makes a
128-bit hash on the basis of some input length. It has been
fairly popular under the years, but due to the discovered
weakness in which collisions could be establish in a
practical time frame. MD6 is the latest edition of the MD
family of hash algorithms, first available in 2008.
Table 3: Comparison between MD Family
Algorithm
Block Size Hash Size
Security
Name
MD2
128 Bits
128 Bits
Secure
MD4
512 Bits
128 Bits
Less
Secure
MD5
512 Bits
128 Bits
Secure
2) SHA FAMILY:
Secure Hash Algorithm 1 [12] or SHA1 is the first
revision of hash algorithm developed by the National
Security Agency. SHA-1 makes a 160-bit hash value and
supports a message of length up to 264 bits. If anyone
wishes to compute the digest larger than 264, it can be done
by dividing the message into smaller messages, no
weakness in SHA1 are known till date. There are variations
of SHA1 like SHA-2 which includes SHA-224, SHA-256,
SHA-384, and SHA-512 comes, that are named as per the
size of the message digest they create.
Table 4: Comparison between SHA Family
Algorithm
Name
SHA160
SHA 256
Block Size
Hash Size
Security
512 Bits
512 Bits
160 Bits
256 Bits
SHA 512
1024 Bits
512 Bits
Secure
More
Secure
Very
Secure
Efficiency
[8]
Average
Slow
Fast
IV.
A.
C. HASH FUNCTIONS
A hash function provides the encryption by using an
algorithm without any key [10]. We can also call them as
one-way hash functions as it is not possible to overturn
the encryption. A patchy-length plaintext is hashed into
a set-length hash value , also called as the message digest
or commonly a hash. These are basically used to serve
truthfulness, if hash of changes, the plaintext also gets
altered. General older hash functions includes of Secure
Hash Algorithm 1 (SHA-1), that makes a 160-bit hash &
Message Digest 5 (MD5), that makes a 128-bit hash. Some
weaknesses were being founded in both MD5 and SHA-1;
newer substitutes like SHA-2 are suggested.
DATA OWNER:
129 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 02, February, 2016
Rahul Sharma et al
VI.
CONCLUSION
REFERENCES
[1]
V.
130 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 02, February, 2016