Improved impossible differential and biclique cryptanalysis of HIGHT |
| |
Authors: | Seyyed Arash Azimi Siavash Ahmadi Zahra Ahmadian Javad Mohajeri Mohammad Reza Aref |
| |
Affiliation: | 1. Information Systems and Security Lab (ISSL), Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran;2. Department of Electrical Engineering, Shahid Beheshti University, Tehran, Iran;3. Electronic Research Institute, Sharif University of Technology, Tehran, Iran |
| |
Abstract: | HIGHT is a lightweight block cipher introduced in CHES 2006 by Hong et al as a block cipher suitable for low‐resource applications. In this paper, we propose improved impossible differential and biclique attacks on HIGHT block cipher both exploiting the permutation‐based property of the cipher's key schedule algorithm as well as its low diffusion. For impossible differential attack, we found a new 17‐round impossible differential characteristic that enables us to propose a new 27‐round impossible differential attack. The total time complexity of the attack is 2120.4 where an amount of 259.3 chosen plaintext‐ciphertext pairs and 2107.4 memory are required. We also instantiate a new biclique cryptanalysis of HIGHT, which is based on the new idea of splitting each of the forward and backward keys into 2 parts where the computations associated to each one are performed independently. The time complexity and data complexity of this attack are 2125.7 and 242, respectively. To the best of our knowledge, this is the fastest biclique attack on full‐round HIGHT. |
| |
Keywords: | biclique block cipher HIGHT cryptanalysis impossible differential lightweight cryptography ubiquitous systems |
|
|