Cryptanalysis of AES-128 and AES-256 block ciphers using lorenz information measure

Encryption algorithms will transform a human interpretable text block or information in to a non-interpretable block of symbols. The objective of any such encryption algorithm will be making the cipher block more non-interpretable and seemingly random block of symbols. So any cipher block will always be random and will purely be a set of random permutations of symbols. The efforts of distinguishing the cipher text of a cipher from random permutation and distinguishing a cipher blocks of different algorithms are called as "distinguisher attacks". Generally, almost all the classical ciphers are distinguishable and even breakable. But the modern ciphers have been designed to withstand against several kinds of attacks and even withstand against distinguisher attack. It means, we cannot even guess the type of cipher used for encryption only by seeing/analyzing the encrypted block of symbols. In this work our focus will be only on distinguisher attack on modern ciphers. For that, we have attempted to distinguish the cipher blocks of AES-128 and AES-256 using a metric called Lorenz Information Measure (LIM) which is commonly used in image and signal classification systems. In our findings, we showed that the cipher blocks of AES-128 and AES-256 are certainly distinguishable from one another.

[1]  Amandeep Kaur,et al.  EFFICIENT HARDWARE IMPLEMENTATION FOR THE ADVANCED ENCRYPTION STANDARD AND RC6 ALGORITHM , 2011 .

[2]  Kai-Kuang Ma,et al.  Fuzzy color histogram and its use in color image retrieval , 2002, IEEE Trans. Image Process..

[3]  Thomas Peyrin,et al.  Improved Cryptanalysis of the Reduced Grøstl Compression Function, ECHO Permutation and AES Block Cipher , 2009, Selected Areas in Cryptography.

[4]  Vincent Rijmen,et al.  Linear hulls with correlation zero and linear cryptanalysis of block ciphers , 2014, Des. Codes Cryptogr..

[5]  Rosario Gennaro,et al.  Securing Threshold Cryptosystems against Chosen Ciphertext Attack , 1998, Journal of Cryptology.

[6]  Mainack Mondal Cryptanalysis of Ciphers Based on AES Structure , 2010 .

[7]  Simson L. Garfinkel,et al.  Anti-Forensics: Techniques, Detection and Countermeasures , 2007 .

[8]  Alex Biryukov,et al.  Distinguisher and Related-Key Attack on the Full AES-256 , 2009, CRYPTO.

[9]  Arjen K. Lenstra,et al.  Using the Cloud to Determine Key Strengths , 2012, INDOCRYPT.

[10]  Mark E. Rorvig Image Retrieval by Content Measure Metadata Coding , 2001, WWW Posters.

[11]  Ho Yean Li,et al.  Heuristic cryptanalysis of classical and modern ciphers , 2015, 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic.

[12]  Keisuke Tanaka,et al.  Quantum Public-Key Cryptosystems , 2000, CRYPTO.

[13]  T. McMurray,et al.  Theoretical and experimental comparison of the Lorenz information measure, entropy, and the mean absolute error , 1994, Proceedings of the IEEE Southwest Symposium on Image Analysis and Interpretation.

[14]  Eli Biham,et al.  New types of cryptanalytic attacks using related keys , 1994, Journal of Cryptology.

[15]  Abdullah Rashed,et al.  A New Approach in Key Generation and Expansion in Rijndael Algorithm , 2006, Int. Arab J. Inf. Technol..

[16]  Alireza Sharifi,et al.  Improved Related-Key Boomerang Cryptanalysis of AES-256 , 2010, 2010 International Conference on Information Science and Applications.