Paper 2019/1318

Automatic Tool for Searching for Differential Characteristics in ARX Ciphers and Applications (Full Version)

Mingjiang Huang and Liming Wang


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 construction of combinational DDT, which makes 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.

Note: We added references [23,24] and added the comparison of relevant results.

Available format(s)
Secret-key cryptography
Publication info
Preprint. Minor revision.
SPARXCHAMARXDifferential cryptanalysisAutomatic searchBlock ciphers
Contact author(s)
huangmingjiang @ iie ac cn
2020-01-08: last of 2 revisions
2019-11-17: received
See all versions
Short URL
Creative Commons Attribution


      author = {Mingjiang Huang and Liming Wang},
      title = {Automatic Tool for Searching for Differential Characteristics in ARX Ciphers and Applications (Full Version)},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1318},
      year = {2019},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.