International Conference on Computer and Knowledge Engineering

Home / 11th International Conference on Computer and Knowledge Engineering

Impossible differential and zero-correlatin linear cryptanalysis of Marx, Marx2, Chaskey andSpeck32

Authors :

Mahshid Saberi¹ Nasour Bagheri² Sadegh Sadeghi³

1- دانشگاه تربیت دبیر شهید رجایی 2- دانشگاه تربیت دبیر شهید رجایی 3- دانشگاه خوارزمی

Keywords :

symmetric cipher ARX, MARX, MARX2, CHASKEY, Impossible differential cryptanalysis, zero-correlation linear cryptanalysis, Mixed Integer Linear Program-ming

Abstract :

ARX symmetric ciphers are ciphers with three additional, rotational and XOR operators. The SPECK, MARX,MARX 2 and CHASKEY algorithms are examples of ARX block cipher structure. In this paper, we consider to the zero-correlation linear cryptanalysis of MARX, MARX 2 and impossible differential cryptanalysis of MARX, MARX2 and CHASKEY algorithms.To our knowledge this cryptanalysis has not been performed on any of the mentioned algorithms so far. Among the available methods for finding the best impossible differential and zero-correlation characteristic in corresponding cryptanalysis, we use the Mixed Integer Linear Programming (MILP) on mentioned algorithms. The MILP is an automated search method to find the best characteristics of a cipher system with a specified number of rounds. With this method for CHASKEY algorithm, we find4 rounds impossible differential characteristic. Also with these10 rounds impossible differential characteristics, the 13 rounds attack done on MARX algorithm and for MARX 2 algorithm,we find 7 rounds impossible differential characteristics that cause to the 11 rounds attack on this algorithm. Moreover we have used zero-correlation linear cryptanalysis on a 10-roundscharacteristics in MARX and have found 7-rounds characteristics for MARX2.