A Block Cipher Algorithm Based on Magic Square for Secure E-bank Systems
Computers Materials & Continua
Nowadays the E-bank systems witnessed huge growth due to the huge developments in the internet and technologies. The transmitted information represents crucial information that is exposed to various kinds of attacks. This paper presents a new block cipher technique to provide security to the transmitted information between the customers and the ebank systems. The proposed algorithm consists of 10 rounds, each round involves 5 operations. The operations involve Add round key, Sub bytes, Zigzag
... thod, convert to vector, and Magic Square of order 11. The purpose of this algorithm is to make use of the complexity of the Magic Square algorithm, the speed of addition operation, the confusion provided by the zigzag, using these operations with Galois field 2 8 GF(2 8 ), and repeating these operations for several rounds to build fast high secure encryption algorithm. This algorithm is designed to provide fast with high complexity and security which is suitable to encrypt the data that is transmitted over the internet. Speed, complexity, and The National Institute of Standards and Technology Framework NIST suite tests were done. The complexity of the proposed algorithm is = ((256) 32 ) r+1 * ((256) 89 ) r+1 + (256) 121 . The proposed technique gives higher speed and security in the encryption and decryption phases, according to the results of the experiments. The degree of randomness has grown by 31.8 percent. Due to a decrease in the time of encrypting and decrypting, as well as the usage of the central processing unit (CPU), efficiency is improved. The encryption process throughput is enhanced by 13%, while the decryption process throughput is increased by 11.6 percent with the recommended approach.