2015 Third International Conference on Robot, Vision and Signal Processing

An Improved AES Encryption Algorithm Based on Chaos Theory in Wireless

Communication Networks

Zi-Heng Yang, Ao-Han Li, Ling-Ling Yu, Shi-Jun Kang, Meng-Jiang Han, Qun Ding*
School of Electrical Engineering, Heilongjiang University, Harbin, Heilongjiang, 150080, China
[email protected], [email protected], [email protected], [email protected], [email protected],
[email protected]

Abstract—for ensuring the security of the information encryption is used to restore plaintext. Compared with data
transmission, safe encryption algorithms are needed to encrypt flow encryption algorithm, grouping encryption algorithm
information in wireless communication networks. Currently, has better expansibility and safety, and easily to be
one relative common encryption algorithm is AES encryption standardization. Hence, grouping encryption algorithm is
algorithm. However, AES encryption algorithm is public, more widely used than the data flow encryption algorithm.
which brings many problems to its security. To solving the safe With the rapid increase of processing data of computer,
problem of AES encryption algorithm, one improved AES the public DES encryption algorithm can not guarantee
encryption based on chaos theory is proposed. Simulation is safety [5]. Instead, AES grouping encryption algorithm is
also conducted by MATLAB to verify the feasibly and security
widely used. The grouping length of AES is 128 bit. The
of the proposed improved AES encryption.
grouping length of AWS encryption algorithm can be
Keywords-wireless communication networks, AES encryption changed. Ten times permutations and substitutions and secret
algorithm; chaos theory; MATLAB; key mixed are taken to every group data to get cryptograph.
AES encryption algorithm has a high safety. The initial
secret key of AES is 128 bit, eleven times secret keys are
I. INTRODUCTION needed to AES. The length of eleven times secret keys is
Security becomes very important with the rapid 1408 bit. Hence, extension is needed to the 128 bit secret key.
development of the wireless communication networks. The secret key extension algorithm is got through the
Secret data and individual privacy data may be contained in operation from the initial secret key. Besides, the secret key
the propagating information [1]. However, electronic extension algorithm is open. Hence, all secret keys will be
eavesdropping technology and electronic deception bring known if attacker knows one secret key of them, which
many treat to information safety. The loss of our nation is up brings safe problems to the safety of the AES encryption
to ten billions. For ensuring the security of the information algorithm. To solving the safe problems of existing AES
transmission, safe encryption algorithms are needed to encryption algorithm, one improved AES encryption
encrypt information in wireless communication networks. algorithm based on chaos theory is proposed in this paper.
Encryption is that secret key and plaintext get through The main contributions of this paper can be summarized as
complex arithmetical operation to form cryptograph [2]. All follows:
plaintext are hidden in cryptograph. Plaintext is the data 1. The improved AES encryption algorithm based on
which is protected. Secret key is generated through chaos theory is proposed in this paper. 1408 bit
encryption algorithm. Cryptograph is transmitted to receiver pseudorandom sequence which generated by the chaotic
through channel after encryption success. Decryption is that system is used as secret key. Well pseudorandom sequence
receiver computes plaintext using cryptograph and secret key. can be provided because of that chaos is a complex nonlinear
A safe encryption algorithm can be described as follows. process. Chaos system has high sensibility to parameter.
Although attacker captures parts of cryptograph or all Although two chaos sequences have tiny difference, two
cryptograph, attacker can not restore plaintext in limited time completely unrelated and different chaos sequences will be
and limited resource [3]. generated in a short time. Exponent separation status of two
Encryption algorithm can be classified as data flow output results will be presented after n times iteration. Hence,
encryption algorithm and grouping encryption algorithm. the proposed improved AES encryption algorithm based on
Data flow encryption algorithm is that plaintext performs a chaos theory have a high algorithm safety, secret key
bitwise exclusive OR on secret key to generate cryptograph. sensibility and more widely secret key space.
Secret key is usually a pseudorandom sequence. Same 2. Simulation is conducted by MATLAB to verify the
pseudorandom sequence is generated when decryption. Same feasibility and safety of the proposed improved AES
pseudorandom sequence performs a bitwise exclusive OR on encryption algorithm based on chaos theory.
cryptograph to restore plaintext. Grouping encryption The rest of this paper is organized as follows. In section
algorithm is that plaintext is divided into some data block II, basis theory of AES algorithm and chaos theory are
which has a fixed bit number. Secret key is also a data block introduced. In section III, the improved AES encryption
which has a fixed bit number [4]. Plaintexts of each group algorithm based on chaos theory is proposed. In section IV,
perform complex mathematical operation on secret key of simulation of improved AES encryption algorithm based on
each group to get cryptograph. Inverse operation of

978-1-4673-9647-9/15 $31.00 © 2015 IEEE

978-1-4673-9646-2/15 159
DOI 10.1109/RVSP.2015.45
chaos theory is conducted by MATLAB. In section V, we H ( X ) is a function which has four bits input and four bits
conclude this paper. output. H ( X ) contains three subfunctions, which are
II. THEORETICAL BASIS SubWord, RotWord and Rc. The process of round secret
key selection is shown in Figure 2.
A. AES encryption algorithm
The plaintext grouping length of AES algorithm is 128
bits. The initial secret key of AES algorithm is 128 bits. AES
algorithm is a ten round iteration process. Four functions are
included in each round iteration, which are SubBytes,
ShiftRows, Mixcolumns and AddRoundkey [6].
1) S-box substitution algorithm: S-box substitution is a
nonlinear substitution system which has eight bit input and
eight bit output. 8 bits input binary numbers are expressed
as characteristic polynomial in finite field to get
multiplication inverse of this characteristic polynomial on
mod [7]. Then affine transformation of the result of
multiplication inverse to get 8 bits output. 8 bits input
corresponding to 256 kinds of 8 bits output. All results will
be got through calculation. Outputs of S-box substitution
algorithm can be found in existing paper.
2) Shiftrows and Mixcolumns: Four rows and four
columns state matrix are generated form 16 bytes plaintext Figure 1. Secret key extension algorithm
information. Shiftrows is that different column numbers
have different excursion. The first row keeps invariability.
The second row rings shift left one bit. The third row rings
shift left two bits. The forth row rings shift three bits.Secret
key extension algorithm: To change the default, adjust the
template as follows.
Mixcolumns conversion is that make a linear
Figure 2. The process of secret key extension selection
conversion to the state matrix of plaintext information. The
input of the mixcolums conversion is a , the output of the 4) Encryption and decryption algorithm: To Encryption
mixcolums conversion is b . We can get equation (1), mainly contains initial secret key to add, SubBytes,
b ( x)  a ( x).c( x) mod( x ∀ 1)
4
(1) ShiftRows, Mixcolumns, AddRoundkey, 128 bits output
Equation (1) can be expressed as equation (2). transformation results that is cryptograph. The process of
decryption is the inverse process of encryption. The flow
b0 ∃ 02 03 01 01∃  a0 ∃
chart of AES encryption algorithm is shown in Figure 3.
b1 %% 01 02 03 01%% a1 %%
 (2)
b2 % 01 01 02 03% a2 %
% % %
!b3 & ! 03 01 01 02 & ! a3 &
3) Secret key extension algorithm: From Figure 1, we
can see that AES encryption need eleven 128 bits secret key.
Hence, secret key extension algorithm of the initial secrete
key is needed. AES secrete key extension contains round
secret key extension and round secret key selection. The
initial secrete key is four words: wo , w1 , w2 , w3 . w4 ,
w5 … w42 , w43 are needed to be extended. The extension
algorithm is shown in equation (3).
wi # wi ∀ 2 ∋ wi ∀ 4 (3)
i  0,1,......,39 .
The subscript i ∀ 3 of wi ∀ 2 is checked when extension.
Function transformation to H ( X ) will be conducted before
wi # wi ∀ 2 operation if i ∀ 3 is integral multiple of four. Figure 3. The flow chart of AES encryption algorithm

160
B. Chaos theory IV. SIMULATION
1) Definition of chaos system: To Chaos is a kind of
A. Chaos sequences generated by Logistic model
chaotic status from its literal meaning. Chaos represents a
kind of complex and disorder status in nonlinear dynamics. The definition of Logistic mapping model can be
Researchers have not given a uniform definition to chaos expressed as equation (4).
system. Currently, people think that any random element are xn ∀1   xn (1 ∗ xn ) (4)
not needed to append in some nonlinear system, nonlinear n  , 2,3 ))) +
1 . When xn ( 0,1]
[ ,  ( (0, 4] , sequences
interaction are existed in the chaos system interior, random x 0 , x1 , x2 , ))) xn generated by Logistic is pseudo-random, non-
phenomenon can be generated by chaos system. convergence, sensitivity to initial values. The values of
2) Characteristic of chaos system: The characteristic of generated sequences are between o and 1.   3.58 ,
chaos system contains boundedness, ergodicity, sensitivity x0  0.75 . The value of x 0 , x1 , x2 , ))) xn simulated by
to initial vales, internal randomness and scale invariance. MATLAB is 0.6713, 0.7900, 0.5939, 0.8634, 0.4221,
III. IMPROVED AES ENCRYPTION ALGORITHM BASED ON 0.8733 and so on. The simulation diagram of Logistic
CHAOS THEORY
sequence is shown in Figure 5.
Secrete key expansion algorithm is public. Attackers can
get secrete key according to secrete key expansion algorithm
if they get one round secrete key. Plaintext will be computed
according to decryption algorithm by attackers after they
know the secrete key. Hence, traditional public AES
encryption algorithm has safety problems.
For improve the safety of AES encryption algorithm.
Pseudorandom sequences which have enough length
generated by Logistic mapping are used in this paper.
Cutting out 1408 numbers from the pseudorandom sequences,
quantize them as AES secrete key. The main characteristic of
pseudorandom number is that there is no derivation between
sequences [8]. Although we know one pseudorandom
number or a pseudorandom sequence, its pervious sequence
value and next sequence value can not be computed. It is
very effective to prevent attackers computing secrete key.
The flow chart of the improved AES encryption algorithm is
shown in Figure
g 4.
Figure 5. The simulation diagram of Logistic sequence

From Figure 5, we can see that the generated values

x 0 , x1 , x2 , ))) xn are between 0 and 1, no cycle is exists. If
x0 is changed, x0  0.74 ,  is not changed. The workshop
of simulated sequences is shown in Figure 6.From Figure 6,
we can see that although the difference between initial is
0.01. Sequences iterated by Logistic are totally different.

Figure 6. Workspace of sequence x after change initial value

Logistic mapping simulation used fixed-point number

also is conducted.   3.58 , x0  0.75 , parts of workspace
Figure 4. The flow chart of improved AES encryption algorithm of generated x 0 , x1 , x2 , ))) xn is shown in Figure 7.

161
 Figure 7. The Logistic sequences generated by the fixed-point
Figure 10. Workspace of cryptograph
From Figure 7, we can see that the binary bit number of
sequences is all no more than 14 bits. Because, the decimal From Figure 10, we can see that the cryptograph is still
point is located between 14th bit and 15th bit. Hence, the 128 bits. The feasibility and correctness of the proposed
values of sequences are all less then 1. Next, Quantify will improved AES encryption algorithm is verified by
be conducted to the 12th bit of each sequence, the MATLAB.
workspace of the Logistic sequence after quantify is shown V. CONCLUSION
in Figure 8.
For solving the safety problems of existed AES
encryption algorithm, an improved AES encryption
algorithm based on chaos theory is proposed in the paper.
Simulation is conducted to verify the feasibly and
correctness of the proposed improved AES encryption
algorithm by MATLAB.
REFERENCES
Figure 8. The Logistic sequences after quantify
[1] J. Zhang, T. Yuan, and H. Lin, “Research of the Combination
Algorithm Based on AES and RSA,” The 2011 Asia-Pacific Youth
1408 bits after quantify will be the secrete key of Conference of Youth Communication and Technology, pp. 217–220,
improved AES encryption algorithm as shown in Figure 8. 2011.
[2] A. A. Hasib, “A comparative Study of the Performance and Security
B. Improved AES algorithm based on chaos theory Issues of AES and RSA Cryptography,” Third 2008 International
1408 bits after quantify as initial secrete key, and write Conference on Conver and Hybrid Information Technology, pp. 505-
510, 2008.
in the workspace as word form. The workspace of w is
[3] R. Matthews, “A High Through Put Low-Cost AES Processor,” in
shown in Figure 9. Cryptologia, vol. 8, pp. 29–41, 1984.
w contains the bit information of 1408 bits Logistic
[4] L. Zhang, and Y. Zhang, “Research on Lorenz Chaotic Stream
sequence after quantify. w terms as the secrete key of AES Cipher,” IEEE International Workshop VLSIDesign &Video Tech,
encryption system in the improved AES encryption pp. 431-434, 2005.
algorithm. The cryptograph is shown in Figure 10. [5] B. Zhang, and C. Jin, “Cryptanalysis of a AES-Based Stream
Chipher,” The 9th International conference for Young Computer
Scientists, pp. 2782-2785, 2008.
[6] G. Hayer, and S. T. Hayes, “Mixed Bus Width Architecture for
LowCost AES VISI Design,” IEEE International Symposium on
Circuits and Systems, pp. 205–208, 2011.
[7] W. Guang, B. Xu, and W. Zhong, “Design and FPGA Implementation
of AES Encryption System,” Chinese Physics B, vol. 17, pp. 3596-
3602, 2008
[8] K. F. Ahmadi, “A Digital Realization of Twisted Tent Map and Ship
Map with LFSR as a Pseudo-chaos Generator,” 3rd International
Conference on Computer and Knowledge Engineering, pp. 207-212,
2013.
Figure 9. Workspace of initial key w

162