Journal of Engineering and Applied Sciences 12 (Special Issue 10): 9035-9040, 2017 ISSN: 1816-949X © Medwell Journals, 2017 Corresponding Author: Estabraq Abdul Redaa Kadhim, Department of Computer Engineering Techniques, Al-Esraa University College, Baghdad, Iraq 9035 AES Cryptography Algorithm Based on Intelligent Blum-Blum-Shub PRNGs Estabraq Abdul Redaa Kadhim, Zaid Khudhur Hussein and Hadi Jameel Hadi 1 2 3 Department of Computer Engineering Techniques, 1 Department of Medical Instrumentation Engineering, 2 Al-Esraa University College, Baghdad, Iraq Department of Computer Engineering Techniques, Al-Mustafa University College, Qom, Iraq 3 Abstract: One of the relative common encryption algorithm in the literature is Advanced Encryption Standard (AES) procedural steps. It is public key algorithm which has a number of drawbacks to its security. This study presents new combining advanced encryption standard with intelligent BBS-PRNGs (i.e., hybrid of Blum-Blum-Shub (BBS) and Iterated Local Search (ILS) metaheuristic technique) for generating strong crypto key using some of non-parametric statistic tests. The simulation tool has been conducted using MATLAB simulator for enhanced AES cryptography model. Key words: AES encryption algorithm, Blum-Blum-Shub (BBS), Iterated Local Search (ILS), PRNGs, artificial intelligence, simulator, conducted INTRODUCTION if a lengthy bit’s sequence is produced. The principal Encryption algorithm can be classified into data flow cracking is comparable with integer factorization. Iterated encryption algorithm and grouping encryption algorithm. Local Search (ILS) is a straightforward and influential Data flow encryption algorithm is that plaintext performs metaheuristic procedure. It employs local search to a a bitwise exclusive or on secret key to generate preliminary solution until it locates a neighboring the best cryptograph. Secret key is usually a pseudorandom possible one (Bishop, 2003). sequence. Same pseudorandom sequence is generated Traditional Blum-Blum-Shub (BBS) has been throughout decryption and pseudorandom sequence classified as one of the best and strong method for performs a bitwise exclusive or on cryptograph to restore random bit sequence but the Improved Blum-Blum-Shub plaintext. Grouping encryption algorithm is related to (Improved-BBS) proved to be generating strong integer plaintext that is divided into some data block of fixed bit numbers and bit sequence for cryptokey purpose. number. Secret key is also a data block which has a fixed The existence of some nonparametric statistic test as bit number (Zhang and Zhang, 2005). Plaintexts of each a means for evaluate the frequency, magnitude and group perform complex mathematical operation on secret randomness of improved BBS-cryptokey had given sober key of each group to get cryptograph. BBS-cryptokey. AES stands for a division of the Rijndael cipher Enhancement of cryptokey basically dependent on created by dual Belgian cryptographers (Daemen and seed number (i.e., size, randomness and distribution of Rijmen, 2001). Rijndael is a relation group of ciphers with BBS-cryptokey are different from one sequence to another dissimilar block sizes and key. National Institute of that have same nBlum) (Kadhim, 2015). Standards and Technology (NIST) had chosen three The AES algorithm idea was first suggested by constituents of the Rijndael family for AES. Every one of Daemen and Rijmen (2001) and later many studies and them with a block size of 128 bits of three dissimilar key techniques have been developed to improve the AES lengths: 128, 192 and 256 bits (Daemen and Rijmen, initial key. 2001). Paul a speedy and protected encrypted procedure Intelligent Blum-Blum-Shub (BBS) is an eminent using substitution mapping, translation and transposing cryptographically protected pseudo arbitrary number methods has been presented. The process of the generator that combine between BBS PRNGs and ILS symmetric encrypted system has dual benefits over metaheuristic search technique. BBS is fully irregular even customary schemes. Firstly, the encrypting and hypothesis is derived from quadratic residues and