A Block Cipher Algorithm Based on Magic Square for Secure E-bank Systems
作者机构:Computer Science DepartmentUniversity of TechnologyBaghdad10011Iraq
出 版 物:《Computers, Materials & Continua》 (计算机、材料和连续体(英文))
年 卷 期:2022年第73卷第10期
页 面:1329-1346页
核心收录:
学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
主 题:Block cipher magic square order 11 complexity NIST suite zigzag GF(28) MS11
摘 要:Nowadays the E-bank systems witnessed huge growth due to the huge developments in the internet and *** transmitted information represents crucial information that is exposed to various kinds of *** paper presents a new block cipher technique to provide security to the transmitted information between the customers and the ebank *** proposed algorithm consists of 10 rounds,each round involves 5 *** operations involve Add round key,Sub bytes,Zigzag method,convert to vector,and Magic Square of order *** 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 28 GF(28),and repeating these operations for several rounds to build fast high secure encryption *** algorithm is designed to provide fast with high complexity and security which is suitable to encrypt the data that is transmitted over the ***,complexity,and The National Institute of Standards and Technology Framework NIST suite tests were *** complexity of the proposed algorithm is=((256)32)r+1∗((256)89)r+1+(256)*** proposed technique gives higher speed and security in the encryption and decryption phases,according to the results of the *** degree of randomness has grown by 31.8 *** to a decrease in the time of encrypting and decrypting,as well as the usage of the central processing unit(CPU),efficiency is *** encryption process throughput is enhanced by 13%,while the decryption process throughput is increased by 11.6 percent with the recommended approach.