A novel method of improvement in advanced encryption standard algorithm with dynamic shift rows, sub byte and mixcolumn
- PDF / 578,725 Bytes
- 6 Pages / 595.276 x 790.866 pts Page_size
- 101 Downloads / 157 Views
ORIGINAL RESEARCH
A novel method of improvement in advanced encryption standard algorithm with dynamic shift rows, sub byte and mixcolumn operations for the secure communication T. Manoj Kumar1
•
P. Karthigaikumar1
Received: 2 November 2019 / Accepted: 23 April 2020 Ó Bharati Vidyapeeth’s Institute of Computer Applications and Management 2020
Abstract In this digital information era, data transmitted over internet is vulnerable to several types of attacks. To preserve our information over internet, it is necessary to use some cryptographic methods. advanced encryption standard is a strong symmetric, non-fiestel cryptographic algorithm which preserves the information transmitted in internet from piracy or attacks. In this research article, a new and an efficient key dependent AES algorithm is presented for securing the data over internet or digitally stored in any remote location. This proposed work gives better avalanche effect and strict avalanche effect on comparing with the original existing AES algorithm. Results of the proposed algorithm are obtained after testing 1000 pairs of samples of different secret key. And it shows that 58% of the times, new proposed algorithm have better avalanche effect than the existing algorithm. Keywords Advanced encryption standard Encryption Decryption S-box Mix column Affine transformation Shift rows Key scheduling MSC-94 02 MSC-94 04 MSC-94 06
secret key for both encryption and decryption operation. AES process data of block size 128 bits with different key sizes, 128,192, 256 bits. To get cipher text through AES algorithm plain text has to go through several rounds of AES process. Key size determines the number of rounds plain text has to be processed. AES algorithm with Key size 128 uses 10 rounds, 192 uses 12 rounds and 256 uses 14 rounds [2–6]. Due to the tremendous growth of technology, it is still possible to decode the 8 rounds in a 10 round AES. Remaining 2 rounds can also be brute forced with sufficient information on either plain text or secret key. Therefore to make AES as strong cryptographic algorithm it is necessary to modify the architecture of the existing algorithm. In this research work, the entire process in the encryption and decryption are made as secret key dependent. The following sections in this article is organized as follows Sect. 2 details the related research works of this research article, Sect. 3 explains the overview of the AES algorithm. In Sect. 4, proposed algorithm is explained in details, whereas in Sect. 5 has experimental results and its explanation and conclusion of this research is given in Sect. 6.
1 Introduction 2 Related researches In 2001, National Institute of Standards and Technology (NIST) published AES as Federal Information Processing 197 (FIPS 197) [1]. AES was originally designed by Belgian researchers, Joan Daemen and Vincent Rijment. AES is a symmetric cryptographic algorithm which uses same & T. Manoj Kumar [email protected] 1
Wadi et al. [7] given an approach to increase the speed of the
Data Loading...
