Security Analysis Of Lightweight Block Cipher

With the popularity of information technology in daily life, the demand for convenience and efficiency of various information devices is increasing, which makes the lightweight block cipher used in resource-limited equipments become a hotspot. Numerous new lightweight block cipher algorithms are devised. However, the incresase of efficiency must be at the expense of the decrease of the security level.At present, some of these new algorithms are faced with the risk of eing cracked. So the security analysis of lightweight block ciphers is very important.In this paper, a special ARX design, only using logical and, rotation,exclusive or operations in whole cipher algorithm as well as discarding traditional S boxes, came into our sight after investigating new algorithms in the latest five years. This paper focuses its typical representative,called SIMECK and SIMON family, and does research on their resistant ability against differential attack. Our contribution:1) Clarify the differential properties of the round function, that is,devise a algorithm which can compute all possible output differentces and their probabilities derived from an input difference, which can replace the function of DDT (Differential Distribute Table).2) Present strategies to improve the differential attack on this kind of algorithm by using multiple path to launch attacks and separate the differential bits which need to verify, so that the attack complexity can be reduced significantly.3) Launch differential attacks on SIMECK and SIMON using these improvement strategies. Improve the attacked rounds in the impossible differential attacks on SIMECK family by applying the multiple path attack. Obtain better attack results of the differential attacks on SIMECK and SIMON family by separating the differience bits which need to verify.