International Journal of Application or Innovation in Engineering & Management (IJAIEM)

Web Site: www.ijaiem.org Email: editor@ijaiem.org

Volume 5, Issue 5, May 2016

ISSN 2319 - 4847

TWO LEVEL SYMMETRIC ENCRYPTION

ALGORITHM FOR DATA SECURITY IN
CLOUD
1

Dr. Mahesh Kumar Sharma,2Pradeep Semwal

Associate Professor Amrapali Institute of Management & Computer Applications, Haldwani ,Uttarakhand
2

Research Scholar (CSE) Uttrakhand Technical University,Uttarakhand

ABSTRACT
With emergence of cloud computing for saving private data on the cloud, Data security over the network and internet has
become an challenge today and achieving good security means good methods used to save data in encrypted way. Therefore,
there is need of better encryption method with better efficiency in order to increase the security and authenticity and to
efficiently decrease computational complexity. Although there are many symmetric key algorithms, we proposed a two level
encryption Algorithm, which uses Symmetric key. This is an algorithm uses binary addition operation, a circular bit shifting
operation and folding method and a symmetric key cryptography .

Keywords: cloud data security; Symmetric key; random no; folding method ;cipher text; binary addition; circular bit
Shifting; Encryption; Decryption.

1. INTRODUCTION
Storing and sharing many confidential private and public data through the network and uses of internet, social network
and online storage are the day today routine task of the society. For storing data on centrally accessible location Storage
area network (SAT) is in practice besides this many crucial and confidential data is also saved in both private and
public cloud .Cryptography is a technique to secure data from unauthorized access when they transmitted over the
network. Cryptography achieves the security goals- confidentiality, integrity, authenticity and non-repudiation by two
operation called encryption and decryption
The original text(Plain Text) , which is to be send over the network, first transferred into a codified non understandable
text, called cipher text using some key (generally a set of values or string of symbols). This technique is known as
encryption. Decryption is just reverse operation of encryption where we retrieved the original text from the cipher text..
Cryptography has classified into Symmetric key cryptography and Asymmetric key cryptography depending on what
types of keys used

Fig 1: Mechanism for Encryption and Decryption

In Symmetric key cryptography sender encrypts the plain text using a secret key and receiver decrypt the cipher text
using the same key. So there is a requirement to send the guarded key to the receiver along with the cipher text. Secrecy
of information in symmetric key cryptography depends on the secrecy and size of secret key (no of bits used to represent
key). The commonly used algorithms of Symmetric key cryptography are DES, 3DES, AES, BLOWFISH etc.
Symmetric key cryptography is also used by various security protocols for secure online communication. e.g. Transport
level security (TLS) uses HMAC algorithm and Internet protocol security (IPSec) uses HMAC and DES algorithms.

Volume 5, Issue 5, May 2016

Page 53

International Journal of Application or Innovation in Engineering & Management (IJAIEM)

Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 5, May 2016

ISSN 2319 - 4847

Symmetric key cryptography is faster than the Asymmetric cryptography, and requirement of storage memory is less as
compared to the Asymmetric Key Cryptography. The proposed method not only encrypt the plain text to be transmitted
but also encrypt the secret key .

2. PROPOSED SYMMETRIC KEY CRYPTOGRAPHY METHOD

We have proposed a two level Encryption algorithm which implements Bitwise circular shift operation and folding
method. This algorithm encrypt the plain text two times to generate the secured ciphered text using bitwise binary
addition operation.
2.1. ENCRYPTION ALGORITHM
Step 1. Read the plain text.
Step 2. Repeat the following step to encrypt the plain text to first encrypted text.
a. Count the length of each Character of the plain text (P) and find the corresponding ASCII value of each
character
b. Add each character ASCII value with the corresponding word length excluding spaces to
generate the first encrypted text.
Step 3. Take user input of any random number.
Step 4. Repeat the following step to generate the cipher key.
a. Consider Most Significant Digit of the input number and generate its corresponding 8-bit Binary number and
count the number of 1 present in it, say n.
b. n bit Left circular shift the digit.
c. Store the shifted decimal value in an array.
d. Read the next bit and follow step 4 until Least Significant Digit is being read.
e. Insert a negative number at the last of the array
Step 5. Do the following steps to generate the cipher text.
a. Add all digits of the input number.
b. If produced result is not a single digit then repeat until a single digit formed.
i. Add all the digits of produced result.
c. Add the single digit value with each letter of the first encrypted text including spaces to generate the final cipher
text.
Step 6. Send the cipher text, the Cipher key and the negative number to the receiver.
2.2. DECRYPTION ALGORITHM (BY RECEIVER)
Step 1. Read the shared negative number and Secret key.
Step 2. Do the following steps to generate the key from Secret key.
a. Initially key=0.
b. Repeat until the shared negative number, indicating end of array is accessed.
i. Consider the first digit from cipher key; generate its corresponding 8bit binary number and count number of 1
present in the binary number, say n.
ii. n bit Right circular shift the digit.
iii. Add the shifted decimal value with key and store the result in key.
c. If generated key is not a single digit then repeat until a single digit formed.
i. Add all the digits of key and store it in key.
Step 3. Do the following steps to generate the plain text from cipher text.
a. Read the cipher text and generate the ASCII value of each letter.
b. Subtract the single digit key from the ASCII value of each letter including spaces to generate the first decrypted
text.
c. Count the length of each word formed in the first decrypted text.
d. Generate the ASCII value of each letter of the first decrypted text and subtract the Corresponding word length
from it.
Step 4. Plain text generated.

Volume 5, Issue 5, May 2016

Page 54

International Journal of Application or Innovation in Engineering & Management (IJAIEM)

Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 5, May 2016

ISSN 2319 - 4847

3. ILLUSTRATION OF PROPOSED METHOD

The proposed encryption and decryption algorithms are illustrated with an example.
3.1. Encryption
Suppose Hello! How are you is the input plain text. To obtain the secrecy we encrypt the plain text twice. First we
encrypted the text (excluding the spaces) using a simple addition method on the ASCII Value of each character with
the length of corresponding word. Then second time encryption has been done by taking a random number as input
which produce the encryption key using folding method as follows:
Lets the random number 462 taken from the user.
1st round: 4+6+2=12
2nd round: 1+2=3
Encryption Key: 3
a. How the plain text is encoded using the encryption key is illustrated as follows:
Generated Ciphered Text: Tnuux*#Huh#{yk#r~#OJ@#NyvprM?=?;
3.2. Key encryption
Now to generate the shared link separate each digit of the random number and convert each digit to their
corresponding binary number. Rotate left each digit according to the number of 1 present in their correspondingbinary
number and store the number in an array.
Receiver received the ciphered text " Tnuux*#Huh#{yk#r~#OJ@#NyvprM?=?;" and two shared link, one array of the
circular shifted digits of the taken input number used for 2nd encyption and another one is a non ciphered number to
specify the end of the array.
3.3. Decryption
Decryption is the reverse process of encryption to decipher the ciphered text. Receiver first fetch the non ciphered
number indicating the end of array and then fetch each digit from array and decipher them. Thenreceiver proceed for
the decryption of the ciphered text as following process.
Decoded number: 462
Applying folding method generate the decryption key as follows1st round: 4+6+2=12
2nd round: 1+2=3
Decryption key: 3
The process of decoding the fetched ciphered text using the decryption key is illustrated as follows:
Deciphered text after decryption:
"Hello! How are you."

4. CONCLUSION
The proposed algorithm uses a simple technique to encrypt the plain text, applying a binary addition Operation on the
character of the plain text twice. The algorithm is simple to understand and implement. A special attention has given
to secure the secret key better to say to secure the shared link using a circular bit shifting operation and folding method.
It is hard to decipher the key and to decrypt the ciphered text without knowing the proper key. Here we work with
string and 8 bit binary data and focused on symmetric key cryptography technique .the same can be applied on a large
character code like unicode and large key size (128 bit and 256 bit) to make it more secure.

REFERENCES
[1]. Sijie Guo, Jin Xiong, Weiping Wang, Rubao Lee Mastiff, A Map Reduce-based system for time based bigdata
analytics, in: 2012 IEEE International Conference on Cluster Computing, 2012,pp.7280.
[2]. Bingsheng He,WenbinFang,QiongLuo,NagaK.Govindaraju,TuyongWang,Mars:aMap Reduce framework on
graphics processors ,in: Proceedings of the17th International Conference on Parallel Architecture sand
Compilation Techniques ,PACT08,ACM, NewYork,NY,USA,2008, pp.260269.

Volume 5, Issue 5, May 2016

Page 55

International Journal of Application or Innovation in Engineering & Management (IJAIEM)

Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 5, May 2016

ISSN 2319 - 4847

[3]. Shadi Ibrahim, Hai Jin, Bin Cheng, Haijun Cao, Song Wu, Li Qi, CLOUDLET: to wards Map Reduce
implementation on virtual machines ,in: Proceedings of the18th ACM International Symposium on High
Performance Distributed Computing,HPDC09,ACM,NewYork,NY,USA,2009,pp.6566.
[4]. Joanna Kolodziej, Fatos Xhafa, Integration of task a bortion and security requirements in GA-based metaheuristics for independent batch Grid schedul-ing,Comput.Math.Appl.63(2)(2012)350364.
[5]. L.M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner. A break in the clouds: towards a cloud definition,
in: ACM SIGCOMM Computer Communication Review, 2008.p.50-55.
[6]. M.B. Mollah, K.R. Islam, and S.S. Islam. Next generation of computing through cloud computing technology, in:
2012 25th IEEE Canadian Conference on Electrical Computer Engineering (CCECE), May 2012.p.1-6.
[7]. Shucheng Yu, Cong Wang, Kui Ren, and Wenjing Lou. Achieving secure, scalable and fine-grained data access
control in cloud computing, in: IN-FOCOM, 2010 Proceedings IEEE, 2010.p.1-9.
[8]. A. Bialecki, M. Cafarella, D. Cutting, O. OMalley, Hadoop: A Framework for Running Applications on Large
Clusters Built of Commodity Hardware. <http://lucene.apache.org/hadoop>.
[9]. E Surya, C. Diviya. "A Survey on Symmetric Key Encryption Algorithm''. International Journal of Computer
Science & CommunicationNetworks, Volume 2(4), 475-477
[10]. Abderrahim, N., Benmansour, F., Seddiki, O., 2012. Integration of chaotic sequences uniformly distributed in a
new image encryption algorithm.Int. J. Comput. Science. (IJCSI) 9 (2).
[11]. Ahmed, H., Kalash, H., Farag Allah, O., 2007. An Efficient Chaos-Based Feedback Stream Cipher (ECBFSC) for
image encryption and decryption.Informatica 31 (1), 121129.
[12]. Bashir, A., Basari, A., Almangush, H., 2012. Novel Image Encryption using an Integration Technique of Blocks
Rotation based on the Magic cubeand the AES Algorithm. Int J. Comput. Sci. 9
[13]. Boneh, D., Durfee, G., 2000. Cryptanalysis of RSA with private key d less than N. IEEE Trans. Inf. Theory 46 (4),
13391349.Burr, W., 2003. Selecting the advanced encryption standard. IEEE Security.
Books Referred
[14]. Behrouz A. Forouzan,. Cryptography & Network Security. Special Indian Edition, Tata McGraw-Hill,2007.
[15]. Atul Kahate. Cryptography and Network Security. Second Edition, Tata McGraw-Hill,2009.
[16]. W. Stallings. Cryptography and Network Security Principles and Practices. Fourth Edition, Pearson Education,
Prentice Hall,2009.
URL Referred

https://en.wikipedia.org/wiki/Cryptography
www.webopedia.com
ww2.valdosta.edu/~sfares/cs330/cs3410.a.hashing.fa8.html
computer.howstuffworks.com/encryption2.htm

Author
Dr. Mahesh Kumar Sharma is renowned academician of uttarakhand and PhD (CSE) in 2009.He has
more than 40 research paper and author of approximate ten books. He is supervisor for Phd in
Uttrakhand Technical University and Dev Sanskriti Vishvidhliya Haridwar, Uttarakhand. His area of
interest and research are use of cloud computing, mobile technology and ICT in e governance.

Pradeep Semwal is research Scholar at Uttrakhand technical university and presently working as
Assistant Professor at Shri Guru Ram Rai Institute of Technology & Science, Dehradun, India. He has
received his master in Computer Application degree from HNB Garhwal University, Uttarakhand,
India in 2002 and Master of Technology (M.Tech) from Karnataka Open University in 2010 ,M.Sc
(Statisitics) from HNB Garhwal University in 1999 and currently pursuing Ph.D from Uttarakhand
Technical University, Dehradun, India.

Volume 5, Issue 5, May 2016

Page 56