Improved Cryptanalysis of an ISO Standard Lightweight Block Cipher with Refined MILP Modelling
| Autor: | Jun Yin, Chuangui Ma, Guang Zeng, Lijun Lyu, Fushan Wei, Jian Song, Chuyan Ma |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Linear programming
Computer science 020207 software engineering Iso standards 02 engineering and technology law.invention Cipher law Linear cryptanalysis 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Differential (infinitesimal) Cryptanalysis Algorithm Block cipher |
| Zdroj: | Information Security and Cryptology ISBN: 9783319751597 Inscrypt |
| DOI: | 10.1007/978-3-319-75160-3_24 |
| Popis: | Differential and linear cryptanalysis are two of the most effective attacks on block ciphers. Searching for (near) optimal differential or linear trails is not only useful for the security evaluation of block ciphers against these attacks, but also indispensable to the cryptanalysts who want to attack a cipher with these techniques. In recent years, searching for trails automatically with Mixed-Integer Linear Programming (MILP) gets a lot of attention. At first, Mouha et al. translated the problem of counting the minimum number of differentially active S-boxes into an MILP problem for word-oriented block ciphers. Subsequently, in Asiacrypt 2014, Sun et al. extended Mouha et al.’s method, and presented a technique which can find actual differential or linear characteristics of a block cipher in both the single-key and related-key models. In this paper, we refine the constraints of the 2-XOR operation in order to reduce the overall number of variables and constraints. Experimental results show that MILP models with the refined constraints can be solved more efficiently. We apply our method to HIGHT (an ISO standard), and we find differential (covering 11 rounds) or linear trails (covering 10 rounds) with higher probability or correlation. Moreover, we find so far the longest differential and linear distinguishers of HIGHT. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|