Proposed new modification of AES algorithm for data security
1 Iraqi Commission for Computers and Informatics, Informatics institute for postgraduate studies, Baghdad, Iraq.
2 Department of Computer Science, Al-Maarif University College, Iraq.
Research Article
Global Journal of Engineering and Technology Advances, 2022, 12(03), 117–122.
Article DOI: 10.30574/gjeta.2022.12.3.0165
Publication history:
Received on 19 August 2022; revised on 24 September 2022; accepted on 26 September 2022
Abstract:
In cryptography, encryption is the process of encoding information. This process converts the original representation of the information, known as plaintext, into an alternative form known as cipher text. Ideally, only authorized parties can decipher a cipher text back to plaintext and access the original information. Encryption does not itself prevent interference but denies the intelligible content to a would-be interceptor.
AES is based on a design principle known as a substitution–permutation network, and is efficient in both software and hardware. Unlike its predecessor DES, AES does not use a Feistel network. AES is a variant of Rijndael, with a fixed block size of 128 bits, and a key size of 128, 192, or 256 bits. By contrast, Rijndael per se is specified with block and key sizes that may be any multiple of 32 bits, with a minimum of 128 and a maximum of 256 bits.
In this research, a method has been suggested using the encryption algorithm multiple and serially since it was used4) - AES (implemented serially. The proposed algorithm is faster because it encrypts 64 bytes together. It encrypts all kinds of data and the number of files that are encrypted (2048) file and in one as it is possible to encrypt several files or one file at the same time.
The performance of this technique has been done by computer using mathlab package.
Keywords:
DES; AES algorithm; Encryption; Decryption; Key; Cipher text; Plaintext
Full text article in PDF:
Copyright information:
Copyright © 2022 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0