International Conference on Computing, Communication and Automation (ICCCA2017)

An Advanced AES Algorithm using Swap and 400

bit Data Block with flexible S-Box in Cloud
Computing
Chinnakandukuri Paul Pramod, Manjit Jaiswal,
Student, Dept. of C.S.E., Asst. Professor, Dept. of C.S.E.,
Guru Ghasidas Vishwavidyalaya, Guru Ghasidas Vishwavidyalaya,
Bilaspur (C.G.), Chhattisgarh, India. Bilaspur (C.G.), Chhattisgarh, India.
[email protected] [email protected]

Abstract— This paper suggests a new Advance Encryption supporting any combinations of data and key size of 128, 192,
Standard (AES) encryption technique. New Algorithm uses 400 and 256 bits. However, AES allows only a 128 bit data length
bit block encryption scheme and a key dependent rotated S-Box that can be divided into four basic operation blocks. Rijndael
which varies according to the 200 bit key provided by the user. was designed to have the following characteristics such as
Fixed S-box allows hackers to study S-box and find weaker resistance against all known attacks, speed and code
points, whereas using key-dependent S-Box, it is harder for compactness on a wide range of platforms and data simplicity.
attacker to do any offline analysis of an attack on one particular These blocks operate on array of bytes and are organized as
set of S-boxes. This helps to store data in cloud securely and to 4×4 matrix that is called the state. For full encryption, the data
transfer data without any obstruction or modification in Cloud is passed through Nr rounds (Nr = 10, 12, 14) [7], [12].
Computing and big data Rijndael rounds contain four different stages namely Sub Byte
Transformation, Shift Row, Mix Column, and Add Round Key
Keywords—AES, Encryption Techniques, Block Encryption, S-
[14].
Box Rotation, Swap, Cloud Computing, Data Transmission
1) Substitution Bytes Transformation
I. INTRODUCTION AES defines a 16 * 16 matrix of one byte or 8 bit
In the present day, technology has evolved very much, so now values, also called as an S-box, which contains the
a days, securing someone’s private data is very important, to do permutation of all possible 256 8-bit values. These values
so we need encryption or ciphering of the data to be transferred, are substituted with the values in state matrix at this stage.
to make data secure from illegal copying, distribution and This provides non linearity, uncertainty and confusion and
attackers. It is also highly needed that a Hacker must not even be also known as S-box substitution stage.
able to peep into the data. Enciphering is very important operation
to preserve the confidentiality and privacy of digital images [6] 2) Shift Rows
transmitted over public networks especially with rapid growth in This stage rotates each row of the block according to
usage of vast communication techniques. One of the strongest its row index providing inter column diffusion. This is also
encryption techniques is AES [1],[10]. This technique is used by known as rotation of rows.
government agencies and banks to secure their data. This 3) Mix Columns
technique is only vulnerable to brute force attack which is almost Some predefined operations with another fixed 4*4
impossible or negligible to be used in breaking, as it requires polynomial matrix are performed in this stage and value of
much amount of time in checking all the possibilities of keys that each cell is varied according to the operation. Here the
can be generated by given constraints.
bytes are treated as polynomials rather than numbers. This
A. Advance Encryption Standard provides inter–byte diffusion and is known as linear
In October 2000, after a four year consistent effort to combination stage.
replace the aging DES, NIST announced the selection of
Rijndael [1], as the proposed AES (NIST 2004). Draft of the 4) Add Round key
Federal Information Processing Standard (FIPS) [14] for the A rounded key is added to the State by bitwise
AES was published in February 2001, Standardization of AES Exclusive-OR (XOR) operation in AddRoundKey
was approved after public review and comments, and Transformation. This also provides diffusion and hence
published a final standard FIPS PUB-197 in December 2001. creates confusion.
Rijndael [14] is a block cipher algorithm developed by
Joan Daemen and Vincent Rijmen [3],[9]. The algorithm is
flexible in

ISBN: 978-1-5090-6471-7/17/$31.00 ©2017 IEEE 1

 International Conference on Computing, Communication and Automation (ICCCA2017)
Decryption of AES algorithm is better than other algorithms.
From the simulation results, they evaluated that AES
algorithm was much better than DES and RSA algorithms.
In [3], their work presents a performance evaluation of
some selected symmetric encryption algorithms. Performance
evaluation shows that time taken by enhanced AES with chaos
and dynamic S-box is nearly same as traditional AES hence
the enhanced AES is a good alternative to the traditional AES
with more confusion. Integrating AES in round structure
increases runtime for more no of rounds but complexity of
encryption is also increased. Increasing complexity makes the
system more attack resistant and the number of rounds in the
round structure can be application specific where time may or
may not be a constraint.
III. PROPOSED WORK

Fig 1.1: Flow Chart for AES Encryption

B. Cloud Compting
Cloud computing is defined as the use of various
computing services from the Internet. To individual users
and businesses to use software and hardware that are
managed by third parties at remote locations and also and
this is done by cloud computing [2]. The cloud computing
uses cloud that will provide the way to deliver the services
whenever and however the user of the cloud needs [2],[5].
Various companies use the cloud computing database to
overcome all the needs of their providers and customers or
users [4].
II. LITERATURE SURVEY
In [1], they have improved the efficiency of AES
algorithm by variable s-box, 200 bit data block and key. The
images in jpeg format were also encrypted into the text format.
So finally it was concluded that the new improvised algorithm
saves a lot of encryption time and provides more security to
the encrypted document.
In [11], a new design for enhancing the security of AES
algorithm has been proposed. This approach design will not
contradict the security of the original AES algorithm by
keeping all the mathematical criteria of AES remain
unchanged. Tried to improve the security of AES by making
its S-box to be key-dependent.
In [13], a new improved version of AES has been
implemented. AES-KDS doesn’t contradict the security of the
AES algorithm. They tried to keep all the mathematical
criteria for AES without change. The security of AES was
improved by making its S-box to be key dependent and by
changing the key expansion procedure.
In [8], research work surveyed the performance of existing Fig 3.1: Flow Chart of Proposed AES Algorithm
encryption techniques like AES, DES and RSA algorithms. Based
on the text files used and the experimental results it was
concluded that AES algorithm consumes least encryption time Rijndael’s algorithm uses basic 128 bit block of data as
and RSA consumes longest encryption time. It was also observed input and a fixed and predefined substitution box for its
that operations. The new algorithm suggests the use of 400 bit
block size of data and 200 bit size of key in 5*5 matrix form

2
 International Conference on Computing, Communication and Automation (ICCCA2017)
and a Substitution box which varies according to the input key Xor these sections together to calculate a number say
given by the user which will make this new algorithm more ‘no’.
robust and secure [11]. The proposed algorithm contains two Shift the original S-box by ‘no’ number of times
extra stages, one for swapping of data blocks and other for towards right.
calculation of S-box based on the 200 bit key. }
4) Sub Byte Operation
For (i=0; i<5; i++)
{
For (j=0; j<5; j++)
{
Take each cell (1 Byte) for replacement. And set the
row no by the first nibble of the cell value and the col
no. by the second nibble of the cell value.
Replace the considered cell by the value at ‘row no.’
row and ‘col no.’ column in the modified S-box
calculated in S-box calculation step.
}
}

5) Shifyt Row Operation

For(i=0; i<5;i++)
{
Set I=0 and take the first row for consideration.
Rotate the considered row by I number of times
towards right.
}

6) Mix Column Operation

Since the block size of plain text is changed from 16
Bytes to 25 Bytes so we need a 5x5 Mix Column matrix.
The Mix Column matrix is constructed from the
coefficients of polynomial used in AES. The original AES
Fig 3.2: Flow Chart of Overall Data Flow used a polynomial of order 3 but we use a polynomial of
order 4 for making it compatible with increased data
A. Swap Operation block. The polynomial used in the proposed algorithm is
Each data block is made to encrypt alternatively in each as following:-
round using Swap Operation. This increases the confusion and 2x4+4x3+3x2+x+1
hence security is increased. Hence if one data block is
encrypted in one round, then other data block is encrypted in For(i=0; i<5; i++)
the succeeding round. {
B. Increased size of Block For(j=0; j<5; j++)
The size of data block has been increased from 128 bit to 400 {
bit. The size of key has been changed from 128 bit to 200 bit. Perform multiplication operation between Ith row of
data block (p_t[5][5]) and Jth column of MixColumn
C. Pseudo Code matrix.
1) Division Operation }
Divide the 400 bit data block into 200 bit data block each. }
2) Swap Operation
{ 7) Add Round Key Operation
Store right matrix into temp matrix For(i=0; i<5; i++)
Shift values of left matrix into right matrix {
Shift values from temp matrix into left matrix For(j=0;j<5;j++)
} {
3) S – Box Calculation p_t[i][j]=p_t[i][j] Xor key[i][j] //p_t[5][5] is data
{ matrix and key[5][5] is key matrix.
Partition the 200 bit key into 25 partitions of 8 bits }
each. }

3
 International Conference on Computing, Communication and Automation (ICCCA2017)
IV. EXAMPLE B. Increased Size of Data Block
The size of data has been increased from 128 bit to 400 bit
data block.
A. Flexible S – Box
The original Rijndael’s AES algorithm uses fixed S – Box
for the substitution operations and uses regular 16*16 matrix 00 05 0A 0F 14 19 1E 23 28 2D
for data and same size of Cipher key. The proposed AES
algorithm uses a flexible S – Box which changes its order 01 06 0B 10 15 1A 1F 24 29 2E
based on the given Cipher key of 200 bit size arranged in 5*5
size matrix. 02 07 0C 11 16 1B 20 25 2A 2F
03 08 0D 12 17 1C 21 26 2B 30
Procedure for generating S – Box: The new S – Box that
is generated will be used throughout the Encryption process. 04 09 0E 13 18 1D 22 27 2C 31
Elements from each cell are XORed from the 5*5 matrix of
Cipher Key given by the user. Then the S – Box is rotated to
the ‘value’ number of times. Fig 4.3: Data Block of 5*10 matrix

Ex: Cipher Key: 7D 55 8E AC 0E 40 3C 08 2D 95 27 5E 37

19 92 42 0F 31 62 95 19 11 66 25 54 (in hex) 00 05 0A 0F 14
01 06 0B 10 15
Apply XOR operation on all bytes.
7D^55^8E^AC^0E^40^3C^08^2D^95^27^5E^37^19^92^42^ 02 07 0C 11 16
0F^31^62^95^19^11^66^25^54= 99 (in HEX)
03 08 0D 12 17
Now the Original S – Box is rotated by 153 (99 in 04 09 0E 13 18
HEX) times. This new rotated S – Box is used in the whole
encryption process.
19 1E 23 28 2D
1A 1F 24 29 2E
1B 20 25 2A 2F
1C 21 26 2B 30
1D 22 27 2C 31

Fig 4.4: Data Block divided as left and right sub blocks

The 400 bit data block is divided as 200 bit left and
right data blocks.

Fig 4.1: Original S – Box

C. Alternate Encryption
The left and right data blocks are encrypted alternatively in
each round. It means if a block is encrypted in one round, then
the other block is encrypted in the other round.
So, the data is swapped after each round of encryption as in
DES algorithm.

Fig 4.2: New S- Box after Rotation

4
 International Conference on Computing, Communication and Automation (ICCCA2017)
D. Shift Row Operation 2. 4GB RAM
Shift Rows operation is performed similar to Orginal 3. 10 GB ROM
Rijndael’s Algorithm, but on 5 * 5 matrix. 4. Dev C++

State Matrix before shifting:

VI. SIMULATION RESULTS
S0,0 S0,1 S0,2 S0,3 S0,4
The proposed algorithm and original algorithm have been
S1,0 S1,1 S1,2 S1,3 S1,4 compared on different set of blocks of data for encryption time
S2,0 S2,1 S2,2 S2,3 S2,4 and the proposed algorithm presents good results with respect
to the running or encryption time of encrypting block of data,
S3,0 S3,1 S3,2 S3,3 S3,4 which is shown in the graph.
S4,0 S4,1 S4,2 S4,3 S4,4
Table I: Simulation Table
Data Size(in Original Enhanced Advanced
State Matrix after shifting:
S0,0 S0,1 S0,2 S0,3 S0,4 MB) AES AES (in AES
(in sec) sec) (in sec)
S1,1 S1,2 S1,3 S1,4 S1,0
10 MB 7.85 5.07 3.22
S2,2 S2,3 S2,4 S2,0 S2,1
20 MB 17.32 9.93 6.34
S3,3 S3,4 S3,0 S3,1 S3,2
40 MB 45.47 25.29 18.03
S4,4 S4,0 S4,1 S4,2 S4,3
80 MB 67.83 37.73 23.85

E. Mix Column Operation

Since the block size of plain text is changed from 16 Bytes to
25 Bytes so we need a 5x5 Mix Column matrix. The Mix COMPARISON CHART
Column matrix is constructed from the coefficients of
polynomial used in AES. The original AES used a polynomial Original Enhanced Proposed
of order 3 but we use a polynomial of order 4 for making it
compatible with increased data block. The polynomial used in 100
the proposed algorithm is as following:-
2x4+4x3+3x2+x+1 50
The Mix Column matrix formed from the expression is as
follows:
0
02 04 03 01 01 10MB 20MB 40MB 80MB
01 02 04 03 01
01 01 02 04 03 Fig 6.1: Chart comparing Encryption time of AES
03 01 01 02 04 Algorithms
04 03 01 01 02 Graph shows that the efficiency of proposed advanced
AES Algorithm has been increased more than 60% compared
to Original AES and is more than 35% efficient compared to
The polynomial matrix is multiplied with 200 bit plain text Enhanced AES Algorithm. The time taken to encrypt data by
and the resultant block is fed to the next step (add rounded the proposed Algorithm is very less and is 60% faster
key). compared to Original AES. The encryption time is 30% less
compared to Enhanced AES Algorithm

V. HARDWARE & SOFTWARE REQUIREMENTS

1. Windows 7 & above

5
 International Conference on Computing, Communication and Automation (ICCCA2017)
X. REFERENCES

SPEED U P [1] S. K. P. S. Manjit Jaiswal, "An Enhanced AES Algorithm based on

Variable S - Box And 200 Bit Data Block," International Journal of
Advanced AES with Original AES Innovative Research in Computer and Communication Engineering, vol.
4, no. 4, 2016.
Advanced AES with Enhanced AES [2] D. S. S. S Sridhar, "A Hybrid Multilevel Authentication Scheme for
Private Cloud Environment," in 10th International Conference on
1 Intelligent Systems and Control (ISCO),, 2016.
0.5 [3] B. N. D. V. B. D. S. K. N. K. Vikas Kaula, "Next Generation Encryption
using Security Enhancement Algorithms for End to End Data
0 Transmission in 3G/4G Networks," in 7th International Conference on
1 0 MB 2 0 MB 4 0 MB 8 0 MB Communication, Computing and Virtualization., 2016.
[4] P. P. D. Nivedita Shimbre, "Enhancing Distributed Data Storage Security
for Cloud Computing Using TPA and AES algorithm," in International
Conference on Computing Communication Control and Automation,
Fig 6.2: Speed Up Chart of Proposed Advanced AES 2015.
Algorithm [5] Z. M. H. Nasrin Khanezaei, "A Framework Based on RSA and AES
Encryption Algorithms for Cloud Computing Services," in IEEE
Conference on Systems, Process and Control (ICSPC 2014)., Kuala
The Speed Up of the proposed Advanced AES Algorithm is Lumpur, Malaysia, 2014.
0.6 times faster than the Original AES Algorithm. It is 0.35 [6] V. P. j. A. K. M. KundanKumar Ramswar Saraf, "Text and Image
times faster than the Enhanced AES Algorithm. The graph Encryption Decryption using Advance Encryption Standard,"
clearly explains that the proposed Advanced AES Algorithm International Journal of Emerging Trends & Technology in Computer
is faster than the Original and Enhanced AES algorithms. Science (IJETTCS)., vol. 3, no. 3, pp. 118 - 126, 2014.
[7] N. T. Anita Ganpati, "Comparitive Analysis of Symmetric Key
Encryption Algorithms.," International Journal of Advanced Research in
VII. IMPLEMENTATION Computer Science and Software Engineering, vol. 4, no. 8, pp. 348 - 354,
2014.
This algorithm can be implemented for fast [8] G. S. Supriya, "A Study of encryption Algorithms (RSA, DES, 3DES
encryption of data in cloud computing so as to store and and AES) for Information Security," International Journal of Computer
secure data at a faster rate. This can also be implemented on Applications., vol. 67, no. 19, pp. 33 - 38, 2013.
Big Data for faster transaction of secured data. [9] D. P. M. Abhishek Sachdeva, "A Study of Encryption Algorithms AES,
DES and RSA for Security," Globla Journal of Computer Science and
VIII. CONCLUSION Technology Network, Web & Security., vol. 13, no. 15, 2013.
[10] B. B. Z. H. A. J. M. S. Y. A.-N. Hamdan O Alanazi, "New Comparative
The proposed advanced AES Algorithm improves the Study Between DES, 3DES and AES within nine factors," Journal of
efficiency of AES Algorithm by Variable S-Box and 400 bit Computing., vol. 2, no. 3, pp. 152 - 157, 2010.
data block as well as block by block alternate encryption. It [11] R. M. S. S. j. R. Julia Juremi, "Enhancing Advanced Encryption
makes the algorithm more secure and takes less time to Standard S - Box Generation Based on Round Key.," Internation Journal
encrypt the data. This helps us to secure data at a higher speed of Cyber-Security and Digital Forensics, the Society of Digital
Information and Wireless Communication, pp. 183 - 188, 2012.
[12] J. P. S. R. Nidhi Singhal, "Comparative Analysis of AES and RC4
Algorithms for Better Utilization," Intrnational Journal of Computer
Trends and technology., no. 2011, pp. 177 - 181, 2011.
[13] R. V. Krishnamurthy G N, "Making AES Stronger: AES with Key
IX. FUTURE WORK
Dependent S - box," International Journal of Computer Science and
In future, this Algorithm will be implemented in parallel Network Security., vol. 8, no. 9, pp. 388 - 398, 2008.
on multicore GPU using OpenCL which is a framework for [14] William Stallings, Cryptography and Network Security, New Delhi:
writing programs that execute across heterogeneous platforms Pearson Prentice Hall, 2008.
consisting both CPUs and GPUs, which will make AES
algorithm more fast and reliable, as many tasks will be carried
out to reduce the time of encryption. This will allow us to
encrypt more data in less time. Encrypting data in parallel
using GPU saves a lot of time which would be of great use in
Cloud Computing as well as Big Data. Encryption of Audio
and Video files of bigger size will be implemented in parallel
on multicore GPU in future.