Design Large Symmetric Algorithm for Securing Big Data

Abstract

Today several Institutions, organizations, companies and research centers deal with hundreds of gigabytes or terabytes of the massive amount of renewable data every day. This large volume of the data requires an appropriate algorithm to protect the sensitive data that may involve credential data. These important data may contain the username and confidential password, financial accounts numbers, social security numbers, secret one-time passwords of online access or digital certificates. The various types of data need high protection from stealing, hacking or malicious actions. In this paper, we have proposed a large block cipher model by following the principles of contemporary block ciphers criteria and implemented real designing steps of algebraic ideas. The proposed cipher is considered as an extended cipher with a big size of encryption/decryption block of 512-bits and a key length of 128-bits which are expanded to reach 512-bits fit to the state matrix. This cipher is based on Substitution and Permutation Network (SPN) structure with three layers of four iterated stages similar to the Advance Encryption Standard (AES) structure, but with an extended size. A new non-linear S-Box It has adopted, new Shifting technique and a distinct mix column of order eight as well as it uses a new technique in expanding key from 128-bits to 512-bits. The proposed algorithm accepts the key length of 128-bits as the initial input of a secret key and the ciphering key is expanded from 128-bits to 512-bits for the first round and the other expanded rounds. The key scheduling technique uses two constant vectors in addition to some shifting steps and extra of XOR bit-wise operations. Therefore, the expanded ciphering key with 512-bit will be generated recursively for each round in a fixed form.