Generalized Meet in the Middle Cryptanalysis of Block Ciphers With an Automated Search Algorithm
Siavash Ahmadi, Mohammad Reza Aref · IEEE Access · 2019
Meet in the middle (MITM) attack is one of the most important and applicable methods for cryptanalysis of block ciphers. In this paper, a more generalized method for MITM attack is considered. For this purpose, a notion, namely cut-set, is utilized by which several numbers of MITM attacks can be performed. However, manual investigation on these cases is time-consuming and sometimes not error-free. Therefore, a new search algorithm is also provided to obtain proper attacks in a timely manner. For examination, this new search algorithm, which could make an automated attack along with some certain ideas, is applied on HIGHT, Piccolo-128, CRAFT and AES-128 block ciphers. The least time complexities which are obtained by generalized MITM attack on full HIGHT, Piccolo-128, CRAFT and AES-128 are 2125.08, 2126.78, 2123.25and 2125.53, respectively. The results on full-round CRAFT are, to the best of our knowledge, the first cryptanalysis results in the single-key model except the designers' investigations. In addition, the results show some improvements for complexities of all the attacks, especially on HIGHT.