Lower data attacks on Advanced Encryption Standard

The Advanced Encryption Standard (AES) is one of the most commonly used and analyzed encryption algorithms. In this work, we present new combinations of some prominent attacks on AES, achieving new records in data requirements among attacks, utilizing only 24 and 216 chosen plaintexts (CP) for 6 -round and 7 -round AES192/256, respectively. One of our attacks is a combination of a meet -in -the -middle (MiTM) attack with a square attack mounted on 6 -round AES-192/256 while another attack combines an MiTM attack and an integral attack, utilizing key space partitioning technique, on 7 -round AES-192/256. Moreover, we illustrate that impossible differential (ID) attacks can be viewed as the dual of MiTM attacks in certain aspects which enables us to recover the correct key using the meet -in -the -middle (MiTM) technique instead of sieving through all potential wrong keys in our ID attack. Furthermore, we introduce the constant guessing technique in the inner rounds which significantly reduces the number of key bytes to be searched. The time and memory complexities of our attacks remain marginal.