Cryptology ePrint Archive: Report 2019/1318

Automatic Tool for Searching for Differential Characteristics in ARX Ciphers and Applications

Mingjiang Huang and Liming Wang

Abstract: Motivated by the algorithm of differential probability calculation of Lipmaa and Moriai, we revisit the differential properties of modular addition. We propose an efficient approach to generate the input-output difference tuples with non-zero probabilities. A novel concept of combinational DDT and the corresponding construction algorithm are introduced to make it possible to obtain all valid output differences for fixed input differences. According to the upper bound of differential probability of modular addition, combining the optimization strategies with branch and bound search algorithm, we can reduce the search space of the first round and prune the invalid difference branches of the middle rounds. Applying this tool, the provable optimal differential trails covering more rounds for SPECK32/48/64 with tight probabilities can be found, and the differentials with larger probabilities are also obtained. In addition, the optimal differential trails cover more rounds than exisiting results for SPARX variants are obtained. A 12-round differential with a probability of $2^{-54.83}$ for SPARX-64, and a 11-round differential trail with a probability of $2^{-53}$ for SPARX-128 are found. For CHAM-64/128 and CHAM-128/*, the 39/63-round differential characteristics we find cover 3/18 rounds more than the known results respectively.

Category / Keywords: secret-key cryptography / SPARX, CHAM, ARX, Differential cryptanalysis, Automatic search, Block ciphers

Original Publication (with minor differences): INDOCRYPT 2019
DOI:
https://doi.org/10.1007/978-3-030-35423-7_6

Date: received 15 Nov 2019

Contact author: huangmingjiang at iie ac cn

Available format(s): PDF | BibTeX Citation

Version: 20191117:181557 (All versions of this report)

Short URL: ia.cr/2019/1318


[ Cryptology ePrint archive ]