Advances in Intelligent Systems and Computing 1084

Fatos Xhafa
Srikanta Patnaik
Madjid Tavana   Editors

Advances in
Intelligent Systems
and Interactive
Applications
Proceedings of the 4th International
Conference on Intelligent, Interactive
Systems and Applications (IISA2019)
Advances in Intelligent Systems and Computing

Volume 1084

Series Editor
Janusz Kacprzyk, Systems Research Institute, Polish Academy of Sciences,
Warsaw, Poland

Advisory Editors
Nikhil R. Pal, Indian Statistical Institute, Kolkata, India
Rafael Bello Perez, Faculty of Mathematics, Physics and Computing,
Universidad Central de Las Villas, Santa Clara, Cuba
Emilio S. Corchado, University of Salamanca, Salamanca, Spain
Hani Hagras, School of Computer Science and Electronic Engineering,
University of Essex, Colchester, UK
László T. Kóczy, Department of Automation, Széchenyi István University,
Gyor, Hungary
Vladik Kreinovich, Department of Computer Science, University of Texas
at El Paso, El Paso, TX, USA
Chin-Teng Lin, Department of Electrical Engineering, National Chiao
Tung University, Hsinchu, Taiwan
Jie Lu, Faculty of Engineering and Information Technology,
University of Technology Sydney, Sydney, NSW, Australia
Patricia Melin, Graduate Program of Computer Science, Tijuana Institute
of Technology, Tijuana, Mexico
Nadia Nedjah, Department of Electronics Engineering, University of Rio de Janeiro,
Rio de Janeiro, Brazil
Ngoc Thanh Nguyen , Faculty of Computer Science and Management,
Wrocław University of Technology, Wrocław, Poland
Jun Wang, Department of Mechanical and Automation Engineering,
The Chinese University of Hong Kong, Shatin, Hong Kong
The series “Advances in Intelligent Systems and Computing” contains publications
on theory, applications, and design methods of Intelligent Systems and Intelligent
Computing. Virtually all disciplines such as engineering, natural sciences, computer
and information science, ICT, economics, business, e-commerce, environment,
healthcare, life science are covered. The list of topics spans all the areas of modern
intelligent systems and computing such as: computational intelligence, soft comput-
ing including neural networks, fuzzy systems, evolutionary computing and the fusion
of these paradigms, social intelligence, ambient intelligence, computational neuro-
science, artificial life, virtual worlds and society, cognitive science and systems,
Perception and Vision, DNA and immune based systems, self-organizing and
adaptive systems, e-Learning and teaching, human-centered and human-centric
computing, recommender systems, intelligent control, robotics and mechatronics
including human-machine teaming, knowledge-based paradigms, learning para-
digms, machine ethics, intelligent data analysis, knowledge management, intelligent
agents, intelligent decision making and support, intelligent network security, trust
management, interactive entertainment, Web intelligence and multimedia.
The publications within “Advances in Intelligent Systems and Computing” are
primarily proceedings of important conferences, symposia and congresses. They
cover significant recent developments in the field, both of a foundational and
applicable character. An important characteristic feature of the series is the short
publication time and world-wide distribution. This permits a rapid and broad
dissemination of research results.
** Indexing: The books of this series are submitted to ISI Proceedings,
EI-Compendex, DBLP, SCOPUS, Google Scholar and Springerlink **

More information about this series at http://www.springer.com/series/11156

Fatos Xhafa Srikanta Patnaik
• •

Madjid Tavana
Editors

Advances in Intelligent
Systems and Interactive
Applications
Proceedings of the 4th International
Conference on Intelligent, Interactive
Systems and Applications (IISA2019)

123
 Multiple Key Encryption (MKE) Technique:
An Encryption-as-a-Service Delivery Model
in Cloud Computing

K. Kuppusamy1(&) and J. Mahalakshmi2

1
Department of Computational Logistics, Alagappa University, Karaikudi, India
kkdiksamy@yahoo.com
2
Department of Computer Science, Alagappa University, Karaikudi, India

Abstract. Cloud Computing, a form of on-demand service offering resources

such as platform, infrastructure, software, database etc., Cryptography, the art of
altering the user defined plain data into inarticulate form, and that exists as a
prime solution to protect the data on network transmission. This research work
specifically focused on, an interesting, Encryption-as-a-service application
delivery model, with a symmetric key algorithm based on the conventional
encryption mode is developed. Key generation for the encryption is a most
important phase of every cryptographic process. Multiple keys are involved for
encryption of data to strengthen the encryption quality via the ICBC Process. It
is tested with various inputs and the quality of the algorithm is investigated. The
Motivation behind this application development is to minimize the execution
time for the encryption within limited storage capacity. The proposed applica-
tion model in this research work, avoids unauthorized attacks such as brute-
force, chosen plaintext, CCA and CPA and the results are analyzed using the
cryptanalysis process. The Performance of the proposed algorithm is analyzed
with statistical measures such as frequency analysis. Comparative analysis is
done to reveal the enhancement of the algorithm. The homogeneity of the data
from the experimental results shows the efficiency of the data of how well it is
encrypted. Evaluation reports state that the developed application service relic’s
potential for authenticating text files with better satisfaction while out-sourced as
an application in cloud computing environment.

Keywords: ICBC
Multiple Key Encryption Algorithm
Matrices

Symmetric key encryption
Substitution operations
Cloud computing
environment

1 Introduction

Cloud Computing offers Services on-demand to its users, based on pay-as-you-use

scheme. Security-as-a-Service or Encryption-as-a-Service is an emerging paradigm in
cloud computing environment, an application model that allows the user to encode their
data to articulate format. There are certain limitations in the existing cloud computing
security models which are related to the authenticity of the data [6]. This paper deals
with a new symmetric key encryption algorithm to enhance the security of the data

© Springer Nature Switzerland AG 2020

F. Xhafa et al. (Eds.): IISA 2019, AISC 1084, pp. 537–545, 2020.
https://doi.org/10.1007/978-3-030-34387-3_66
538 K. Kuppusamy and J. Mahalakshmi

when the client prefers the security service. The opportunity of hacking the data is more
prevalent in the transmission spectrum. Cryptography offers the security of data
through the conversion of data into an intelligible format. Public Key encryption and
Private Key encryption are the types of encryption scheme, in which both the consigner
and consignee share the same secret key that is related in an easily computable way in
the first method and the second involve separate keys [11]. Moreover, the multi-
tenancy model and the pooled computing resources in computing have introduced new
security challenges [7] that require novel techniques. It is mandatory to use them in an
optimized manner to avoid overheads [1]. The logical operations employed in key
generation method in the proposed work offer high security for keys.

2 Related Research Works

Sastry, Udaya Kumar and Vinaya Babu [12], have developed block ciphers by an
iterative method. Sravan Kumar, Suneetha and Chandrasekar, [15], reported on the
utilization of the logical operator XOR logical operator and its working algorithm, in
block ciphers. According to the authors, key scheduled algorithm is less prone to
timing attacks. Srikantaswamy and Phaneendra, [16], demonstrated the use of one time
padding that can be used for efficient encryption scheme by involving arithmetic and
logical operations. Kameswari, Kumari and Kumar [3], explained the use of block
ciphers in encryption and multi code generation based on secret key generation. Paul,
Kumar and Mandal, [8], proposed a technique that is very secure and suitable for
encryption of large files of any type. Session Based Symmetric Key cryptographic
Technique (SBSKCT) considers the plain text as a string with finite number of binary
bits. This input binary string is broken down into blocks of various sizes. Roy [14],
demonstrates the use of a cryptographic method called UES – III (Ultra Encryption
Standard III). It is a Symmetric key Cryptosystem which includes multiple encryptions,
bit-wise randomization and a new advanced bit-wise encryption technique with feed-
back. Ramakrishna Das, Saurabh Dutta [12], extended their views on private key
encryption with use of some logical operators.
Anupriya, Agnihotri, Soni and Babelay [2], put forward a novel approach for
encryption using XOR based Extended Key. Satyajeet R. Shinge, Rahul Patil, in the
year of 2014 [13], explained the encryption algorithm based on ASCII characters.
Padhmavathi, B. Ray, Arghya, Anjum, Alisha, Bhat, Santhoshi in 2014 [9], explained
the advancement of conventional encryption technique by using the Merkle-Hellman
Knapsack Cryptosystem. Vaidehi and Rabi, in the year 2014 [17], experimentally
verified the design and analysis of AES-CBC mode for high security applications. Li,
Li and Shi [19], reported about tripartite secret key protocol in the private cloud file
encryption. An encryption algorithm that is certificate less, being employed in the work
by authors, yields better results for large scale environment.
 Multiple Key Encryption (MKE) Technique 539

3 Preliminaries
3.1 Access Structure
The basic mathematical rationale for the implementation of this proposed encryption
Algorithm is in a matrix form. Each text file with varied input (text, numerical,
alphanumeric, special characters) is converted to its corresponding binary bits, each of
8 bits. Let us assume that the input data is to be filled in 8  8 Matrix blocks with 64-bit
input elements as binary bits. If M is a matrix, then Mnm is a 8  8 matrix, whose
elements are represented using 8-bit binary structure, where m, n indicates the elements
of the matrix. The Improved Cipher Block Chaining operation mode is followed after
this design rationale to strengthen the key generation process.

3.2 Preprocessing
Block cipher is a form of substitution cipher where the data processed as chunks.
Cipher Block Chaining is one of the encryption schemes that acts as a primary model
for encrypting data stored in the cloud data centers as chunks. It needs an Initialization
Vector (IV), with 8 elements of which the other elements are disjunctive. The key
generation is random most of the time. The output of the first block remains as input to
the consequent block. Every preceding block element is XORed, with the successor so
that the decryption has to be dependent on the previous block. Hence, a single bit error
in any block element will lead to decryption failure.

4 Encryption-as-a-Service in Cloud Computing Using New

Cryptosystem MKE

4.1 Multiple Symmetric Key Encryption Algorithms

Multiple Symmetric key encryption algorithm is a newly proposed algorithm which
employs the same key for both encryption and decryption. Consider the given input as
in the text file. The process begins with the separation of input characters into binary
bits, which is then filled in the matrix format of 8  8 blocks, with 64 elements. The
elements referred here are in binary values and is placed sequentially across every row.
The following is the algorithm to encrypt the given text file.

4.2 Algorithm

Step 1: Read the input text file consists of the original plain text to get encrypted.
Step 2: Convert the corresponding character (Including Numeric’s, Characters and
Alphanumeric) to corresponding Binaryvalues.
Step 3: Fill the converted binary strings in the basic access structure, Matrix form
comprises of 8  8 blocks, with 64 elements, till end of file is reached.
540 K. Kuppusamy and J. Mahalakshmi

4.3 Key Generation

Key generation is the most significant part of the cryptographic process. In this pro-
posed algorithm key generation takes place in two steps. The first key generation is
from the input matrix itself. The following procedure describes the key generation
process in brief.
Step 1: Consider the 8  8 blocks, with 64 elements, from the input matrix.
Step 2: Set the Initialization vector with 8-bit binary input as 1  8 matrix.
Step 3: Assume that Xi is the initial 8-bit of the block matrix and Yi be the Ini-
tialization vector with 1  8 blocks.
Step 4: The first key is generated as a result of the improved cipher block chaining
algorithm, which ends from the chaining process.
Step 5: The key thus generated from the input file is XORed with the input file
blocks.
Step 6: Second key is generated with the help of pseudorandom number generators.
Step 7: The resultant partially encrypted blocks as a result of first key generation is
again XORed with the key generated from the PRNG.
Step 8: Repeat the process, till end of file is reached.
Step 9: Convert the binary strings to corresponding ASCII codes.
Step 10: The evolved matrix blocks is completely ciphered blocks.

4.4 Decryption Algorithm

Step 1: Read the output text file consists of the encrypted text values.
Step 2: Convert the corresponding character (Including Numeric’s, Characters and
Alphanumeric) to corresponding Binary values.
Step 3: Fill the converted binary strings in the basic access structure, Matrix form
comprises of 8  8 blocks, with 64 elements, till end of file is reached.
Step 4: The first key is generated as a result of the improved cipher block chaining
algorithm, which ends from the chaining process.
Step 5: The key thus generated from the input file is XORed with the output file
blocks.
Step 6: Second key is generated with the help of pseudorandom number generators.
Step 7: The resultant partially decrypted blocks as a result of first key generation is
again XORed with the key generated from the PRNG.
Step 8: Repeat the process, till end of file is reached.
Step 9: convert the binary strings to corresponding ASCII codes.
Step 10: The evolved matrix blocks is completely deciphered blocks.
The following Fig. 1, is the block diagram of the proposed Multiple Key
Encryption Algorithm.

4.5 Illustration for the Proposed Algorithm

The following example shows the working procedure of the proposed encryption
algorithm. Let as consider text file with finite number of characters that includes
 Multiple Key Encryption (MKE) Technique 541

INPUT 8 x8 IN
CIPHER ENCIPHERED
DATA BINARY
TEXT TEXT BLOCK IN
BINARY

ASCII INITIALIZ
ATION XOR
ASCII CODE

IMPROVED
KEY 2
BINARY CBC

BINARY
CODE

KEY 1 CIPHERED
8x8 TEXT BLOCK
MATRIX IN BINARY CIPHER TEXT
BLOCKS

Fig. 1. Block diagram for encryption process with key generation

numbers, letters, and special characters all. The sample text considered here is “IN-
PUTVALAlagappaUniversityresearch][.;/’-,”. Every input character is converted to
8  8 matrix blocks. From the given input series the first eight characters INPUTVAL
is taken and equivalent ASCII code is processed. Now the ASCII code is transformed
into their binary values and occupied in the 8  8 matrix block in horizontal manner.
Consider the given block as PBXi (Process Block X where I indicates 0–7 bits).
PBXi PBYi
542 K. Kuppusamy and J. Mahalakshmi

The initialization vector be [0 1 0 1 0 1 0 0]. The converted binary bits matrix PBXi
now fed to the chaining operation mode. The first input bit values (0–7) is XORed with
the initialization vector IV. The output is again XORed with the second input bits
(0–7). This is continued until end of the loop is reached. Since, it is operated on the
block cipher mode, all blocks were simultaneously transformed. The output is the
resultant matrix block PBYi. Now the Block matrix PBYi is XORed with PBXi.
The XOR logical operator is employed in every place since it is the self invertible
operator. Hence, when the number of blocks increases the computational complexity of
the process becomes low. Again, this is converted to binary format. For the decryption,
the reversible order of the encryption steps was followed.

5 Results and Discussions

The proposed method is implemented for Windows 7 operating system with Core-i3 and
3 GB RAM, on Visual Studio 2010, with C# language. The experimental results are
analyzed for various form of text with various volumes and their performance evaluation
is done. The results show the security of the proposed encryption algorithm against
various attacks. Efficacy of the proposed algorithm is demonstrated through the statistical
measures such as the entropy/Frequency analysis, poker test measure etc. The experi-
mental result is done with various standard input data and their outcomes are analyzed.

5.1 Experimental Results

This section presents the results and outcomes in Table 1, by employing the proposed
Multiple Key Encryption algorithm. Another notable feature is that since every data is
stored as matrix the computational complexity is also becoming less, the improved
cipher block chaining works simultaneously as chunks and made the execution faster.

Table 1. Experimental results of encrypted and decrypted text with time in milliseconds
Plain text Encrypted Decrypted Encryption time in Decryption time
text text (msec) in (msec)
sampleout ♥♂┐⌠*ƮP sampleout 1340 ms 1345 ms
-
12345678 6_5♠╣◊◘ 12345678 595 ms 590 ms
◄
Alagappa #aJ_ð"♠q Alagappa 1245 ms 1245 ms
(19ma!`) &t%_@E” (19ma!`) 1036 ms 1036 ms
&89as + -6 ©rwb$◄K♥ &89as + -6 1559 ms 1560 ms

5.2 Performance Analysis

Encryption and Decryption Time

Table 2 depicts the implementation done on various volumes of text file in Kilobytes.
The measurement was taken place in seconds.
 Multiple Key Encryption (MKE) Technique 543

Table 2. Table with varied volume of contents in file and the time taken
Size of file in kilo- bytes Time in milli seconds
560 kb 13000 ms
187 kb 5000 ms
16 kb 2000 ms
9345 kb 18904 ms
126789 kb 98754 ms

5.3 Security Analysis

In the scenario of this proposed research work two important general Cipher Block
chaining is against this CCA and CPA. Beside this, algorithm works on multiple key
chaining feature and again XORed with the PRNG. This makes the system more
complex, such that if a single bit error lies then the whole text will lead to collapsed.
Moreover, when multiple keys are employed for the encryption, also in binary bits if a
single element is misplaced then the intruder will end with wrongkeys.

5.4 Comparative Analysis

A comparative analysis is done between the proposed algorithm to that of various
existing algorithms that work on bitwise operations basis. The proposed algorithm is
compared with various existing works such as [5, 18]. The following Fig. 2, represents
the difference analysis between the Extended MSA method (DJSA), Advanced
Encryption Algorithm as well as our proposed scheme.

Encryption and Decryption time in

Ms
40000
T 35000
i 30000
25000
m 20000
e 15000
10000
5000 560kb
i 0
n 187 kb
Extended Advanced Hybrid Proposed
16kb
MSA – DJSA Encryption Encryption MKE
m Algorithm Algorithm and Algorithm
s Decryption
Algorithm
Existing and Proposed Algorithm

Fig. 2. Chart depicting comparative statistics in milliseconds.

544 K. Kuppusamy and J. Mahalakshmi

6 Conclusion

In the existing cloud services, the security or the encryption services remain low while
comparing the others. The Proposed Multiple Key Encryption Algorithm, presented in
this research work basically alters the form of data and works better for data security in
cloud paradigm. It is verified with various experiments that improve the encryption
strength. The block ciphers are involved for the implementation, which works against
the parallelization and the altering of entire data to 0’s and 1’s, leads to most important
devastation if there is an even error in a single bit. Since consistency followed in the
design rationale it automatically fastens the processing speed. The experimental results
show minimum time for encryption of data and prove this presented algorithm is less
prone to timing attacks. Hence, in cloud computing, this hybrid Improved cipher block
chaining with multiple key encryption security services yield a better solution for
encryption services to the users.

Acknowledgement. The author express deep sense of gratitude to the Alagappa University,
Karaikudi, India for the financial assistance through the RUSA Phase 2.0, to carry out this
research work.

References
1. Kakkar, A., Singh, M.L., Bansal, P.K.: Mathematical analysis and simulation of multiple
keys and S-Boxes in a multinode network for secure transmission. Int. J. Comput. Math. 89
(16), 123–214 (2012)
2. Anupriya, E., Agnihotri, A., Soni, S., Babelay, S.: Encryption using XOR based extended
key for information security – a novel approach. Int. J. Comput. Sci. Eng. 3(1), 146–154
(2011)
3. Pratha, A.K., Kumari, R.C., Kumar, L.P.: Scheme of encryption for block ciphers and multi
code generation based on secret key. Int. J. Network Secur. Appl. (IJNSA) 3(6), 141–148
(2011)
4. Schiestl, C.: Pseudozufallszahlen. Der Kryptographie Klagenfurt Press, Klagenfurt (1999)
5. Chatterjee, D., Nath, J., Dasgupta, S., Nath, A.: A new Symmetric key Cryptography
Algorithm using extended MSA method: DJSA symmetric key algorithm. In: International
Conference on Communication Systems and Network Technologies. IEEE (2011)
6. Elashry, I.F., Faragallah, O.S., Abbas, A.M., ElRabaie, S., Fathi, E., El Samie, A.: A new
method for encrypting images with few details using Rijndael and RC6 block ciphers in the
electronic code book mode. Inf. Secur. J. Global Perspect. Taylor Francis 22(1), 193–205
(2012)
7. Huang, K., Chiu, J., Shen, S.: A novel structure with dynamic operation mode for
symmetric-key block ciphers. Int. J. Network Secur. Appl. (IJNSA) 5(1), 17–36 (2013)
8. Paul, M., Kumar, J., Mandal, A.: Universal session based bit level symmetric key
cryptographic technique to enhance the information security. Int. J. Network Secur. Appl.
(IJNSA) 4(4), 123–136 (2012)
9. Padhmavathi, B., Ray, A., Anjum, A., Bhat, S.: Improvement of CBC encryption technique
by using the Merkle-Hellman Knapsack Cryptosystem, Intelligent systems and controls
(ISCO). In: 7th International Conference 4–5 January, Coimbatore, Tamilnadu, India,
pp. 340–344. IEEE (2013)
 Multiple Key Encryption (MKE) Technique 545

10. Kuppuswamy, P., Al-Khalidi, S.Q.Y.: Hybrid encryption/decryption technique using new
public key and symmetric key algorithm. MIS Rev. 9(2), 1–13 (2014)
11. Das, R., Dutta, S.: An approach of bitwise Private-key Encryption, technique based on
Multiple Operators and numbers of 0 and 1 counted from binary representation of Plain
Text‘s single character. Int. J. Innovative Technol. and Exploring Eng. 2, 1–6
12. Sastry, V.U.K., Udaya Kumar, S., Vinaya Babu, A.: A large block cipher using modular
arithmetic inverse of a key matrix and mixing of the key matrix and the plaintext. J. Comput.
Sci. 2(9), 698–703 (2006)
13. Shinge, S.R., Patil, R.: An encryption algorithm based on ASCII value of data. Int.
J. Comput. Sci. Inf. Technol. 5(6), 7232–7234 (2014)
14. Roy, S., Maitra, N., Agarwal, S., Nath, J., Nath, A.: Ultra Encryption Standard
(UES) Version-III: advanced symmetric key cryptosystem with bit-level Encryption
algorithm. Int. J. Modern Educ. Comput. Sci. 7, 50–56 (2012)
15. Kumar, D.S., Suneetha, C.H., Chandrasekhar, A.: A block cipher using rotation and logical
XOR operations. Int. J. Comput. Sci. Issues 8(6), 142–147 (2011)
16. Srikantaswamy, S.G., Phaneendra, H.D.: Enhanced one time pad cipher with more
arithmetic and logical operations with flexible key generation algorithm. Int. J. Network
Secur. Appl. (IJNSA). 3(6), 243–248 (2011)
17. Vaidehi, M., Rabi, B.J.: Design and analysis of AES-CBC mode for high security
applications. In: Current Trends in Engineering and Technology 2nd International
Conference, pp. 499–502 (2014)
18. Gupta, V., Singh, G., Gupta, R.: Advanced cryptographic algorithm to improve data
security. Int. J. Adv. Res. Comput. Sci. Software Eng. 2(1), 1–6 (2012)
19. Li, X., Li, W., Shi, D.: Enterprise private cloud file encryption system based on tripartite
secret key protocol. In: International Industrial Informatics and Computer Engineering
Conference, pp. 166–169. Atlantis Press (2015)