Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
(IJECET)
Volume 7, Issue 1, Jan-Feb 2016, pp. 01-09, Article ID: IJECET_07_01_001
Available online at
http://www.iaeme.com/IJECETissues.asp?JType=IJECET&VType=7&IType=1
Journal Impact Factor (2016): 8.2691 (Calculated by GISI) www.jifactor.com
ISSN Print: 0976-6464 and ISSN Online: 0976-6472
IAEME Publication
1. INTRODUCTION
From a global perspective there exists a growing awareness and need to prepare for
and react to domestic and international security threats for wireless communication,
which is directly attributed to continuously increasing demand for high quality
security services and devices to protect user data transmitted over wireless channels.
Cryptography has emerged as a solution which plays mandatory role in information
http://www.iaeme.com/IJECET.asp
editor@iaeme.com
security against various attacks. For this purpose two types of cryptography systems
has been developed: Symmetric (secret key) & asymmetric (public key). Symmetric
key uses homogenous key for sender and receiver to encrypt the plain text and to
decrypt the cipher text, as in DES, 3DES, AES. Asymmetric key uses different key
for encryption and decryption of data such as in RSA algorithm. Symmetric
cryptography is more worthy for the encryption of a huge amount of data. AES is the
most recent of the four current algorithms approved for federal in the United States by
the National Institute of Standards and Technology (NIST) and widely accepted to
replace old standard DES as the new symmetric encryption algorithm [2]. The AES
algorithm is a symmetric block cipher that processes data blocks of 128 bits using a
cipher key of length 128, 192, or 256 bits. Each data block consists of a 4 4 array of
bytes called the state, on which the basic operations of the AES algorithm are
performed [2].The proposed AES algorithm in this paper differs from conventional
AES as it is using 200 bits block size and 200 bits key size both. Number of rounds is
constant and equal to ten in this algorithm. The key expansion and substitution box
generation are done in the same manner as in conventional AES block cipher. AES
has 10 rounds for 128-bit keys, 12 rounds for 192-bit keys, and 14 rounds for 256-bit
keys [3].
2. PROPOSED ALGORITHM
Initiating Phase: Encryption Algorithm
At the beginning of encryption step, input of 200 bit is copied to the state array of 5*5
matrix. The data bytes are filled initially in columns then in rows. After that next step
initial round key addition is performed, following to that ten rounds of encryption is
performed. The first nine rounds are similar with minor difference in its final round.
As described below in fig1 each of the first nine rounds follows four transformations:
Sub byte;
Shift rows;
Mix columns;
Add round Key.
In last and final step mix column transformation is not performed.
editor@iaeme.com
http://www.iaeme.com/IJECET.asp
editor@iaeme.com
3. DECRYPTION ALGORITHM
Decryption is the process of decoding the data into plain text that has been encrypted
into the secret form. The Decryption structure for proposed algorithm as shown below
in figure.5 is obtained by simply inverting the encryption structure which is explained
above. In accordance with the transformations steps in the encryption, Inv Sub Bytes,
Inv Shift Rows, Inv Mix Columns, and Add RoundKey are the transformations used
in the decryption as shown in Fig. below. The round keys are the same as those in
encryption generated by Key Expansion, but are inverted before use (used in reverse
order )[1].
http://www.iaeme.com/IJECET.asp
editor@iaeme.com
http://www.iaeme.com/IJECET.asp
editor@iaeme.com
Figure 6.2 Comparison of decryption time of algorithms for large for large data
From the above graphs, it can be observed that for large block of data AES-200
encryption time per bit is reduced up to 20% and decryption time per bit is increased
up to 25%.
4.2. Throughput
The throughput is defined as number of bits that can be encrypted or decrypted during
one unit of time. As it was explained previously hat all AES variant has equal block
http://www.iaeme.com/IJECET.asp
editor@iaeme.com
size of 128 bits and the proposed algorithm has block size of 200 bits. Thus, in form
of equation the throughput may be defined as:
=128/
=200/
Where,
is representation of throughput for conventional algorithms,
is representation of throughput for proposed algorithm,
denotes the
time taken to encrypt the 128 bit block message,
represents time taken to
encrypt the 200 bit block message of conventional algorithm. In Fig 7.1 below,
throughput for encryption side is drawn while the throughput at the decryption side is
plotted in Fig 7.2.
http://www.iaeme.com/IJECET.asp
editor@iaeme.com
5. CONCLUSION
The work explained in this paper represents a new AES model using large block size
with 200 bits instead of conventional AES using 128 bit block size. The block used in
this model comprises of 5 no. of rows as well as columns i.e. 5*5 matrix. Increased
matrix size doesnt cause any change to the basic functional operations. Thus all the
steps are same as used in conventional AES algorithm excluding the Mix Column
Step transformation only. In mix column transformation function in finite filed
diffusion occurs n form of multiplication of matrix. As weve used large block size,
thus it requires a new 5* 5 matrix to enable the matrix multiplication [3] . In this
paper initially we have compared encryption and decryption time for various AES
standards and then compared the same with our proposed algorithms time. Generally
encryption time is longer than decryption time because encryption takes place
sequentially while decryption takes place in parallel manner. Weve concluded that
for large block of data AES-200 encryption time per bit is reduced up to 20% and
decryption time per bit is increased up to 25% than conventional AES. Later on, we
compared the throughput of various AES standards and concluded that that the
throughput at encryption end of AES-200 is 15% more than AES-128, & 20% more
than AES-192 and 30% more than AES-256. The decryption process of AES-200 is
slower than conventional AES. On the basis of Security the proposed model is tested
by performing: Strict Avalanche Criterion and Bit Independence Criterion. SAC
reveals the probability of the bit change while the BIC reveals the correlation that
output bit possess. Both criteria analyzed that the proposed algorithm falls within the
desired level of security. Hence, it can be said that the proposed model is secure and
can be highly preferred for huge data communication.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
http://www.iaeme.com/IJECET.asp
editor@iaeme.com
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[9] Amish Kumar , Mrs. Namita Tiwari, Efficient implementation and avalanche
effect of AES International Journal of Security, Privacy and Trust Management
(IJSPTM), Vol. 1, No 3/4, August 2012.
A Review of Cryptography Techniques and Implementation of AES for Images ,
International Journal of Computer Science and Electronics Engineering (IJCSEE)
Volume 1, Issue 4 (2013) ISSN 2320-401X; EISSN 2320-4028
Diaa Salama Abdul. Elminaam, Hatem M. Abdul Kader and Mohie M.
Hadhoud, Performance Evaluation of Symmetric Encryption Algorithms on
Power Consumption for Wireless Devices International Journal of Computer
Theory and Engineering, Vol. 1, No. 4, October, 2009.
B.Sujitha, Dr.B.Karthikeyan, Study, Simulation and Analysis of Advanced
Encryption Standard (AES) Algorithm IJIRSET Volume 3, Special Issue 1,
February 2014
Atul Kahate, Cryptography
Stallings W., Cryptography and Network Security, Third Edition, Pearson
Education, 2003.
Roshni Padate and Aamna Patel. Image Encryption and Decryption Using AES
Algorithm. International Journal of Electronics and Communication Engineering
& Technology, 6(1), 2015, pp. 23 - 29.
Dhanya Pushkaran and Neethu Bhaskar. AES Encryption Engine for Many Core
Processor Arrays for Enhanced Security. International Journal of Electronics and
Communication Engineering & Technology, 5(12), 2014, pp. 106 - 111.
AUTHOR PROFILE
AYUSHI ARYA Received her B. Tech Degree in Bio Medical Engineering from
CITM, Faridabad, (Maharishi Dayanand University) in 2012 and she is M. Tech
student now in Royal Institute of Management and Technology affiliated to
DCRUST, Haryana, respectively. She had worked as an Application and service
engineer for Medical Devices Industries. Her research interests include medical with
electronics, Telecommunication, cryptography, Scope of electronics and
communication in field of medical devices.
MOHINDER MALHOTRA Head of Department, (Dept. of Electronics and
Communication Engineering), Royal Institute of Management and Technology,
Affiliated to DCRUST, Haryana.
http://www.iaeme.com/IJECET.asp
editor@iaeme.com