Cryptology ePrint Archive: Report 2018/899

Differential Cryptanalysis of Round-Reduced SPECK

Ashutosh Dhar Dwivedi and Pawel Morawiecki

Abstract: In this paper, we propose a new algorithm inspired by Nested to find a differential path in ARX ciphers. In order to enhance the decision process of our algorithm and to reduce the search space of our heuristic nested tool, we use the concept of partial difference distribution table (pDDT) along with the algorithm. The algorithm itself is applied on reduced round variants of the SPECK block cipher family. In our previous paper, we applied a naive algorithm with a large search space of values and presented the result only for one block size variant of SPECK. In this new approach, we provide the results within a simpler framework and within a very short period of time for all bigger block size variants of SPECK. More specifically, we report the differential path for up to 8, 9, 11, 10 and 11 rounds of SPECK32, SPECK48, SPECK64, SPECK96 and SPECK128, respectively. To construct a differential characteristics for large number of rounds, we divide long characteristics into short ones, by easily constructing a large characteristic from two short ones. Instead of starting from the first round, we start from the middle and run the experiments forwards as well as in the reverse direction. Using this method, we were able to improve our previous results and report the differential path for up to 9, 10, 12, 13 and 15 rounds of SPECK32, SPECK48, SPECK64, SPECK96 and SPECK128, respectively.

Category / Keywords: Differential path, Nested Monte-Carlo Search, ARX ciphers, SPECK Cipher, Differential Cryptanalysis

Date: received 23 Sep 2018, last revised 24 Nov 2018

Contact author: ashudhar7 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20181124:165139 (All versions of this report)

Short URL: ia.cr/2018/899


[ Cryptology ePrint archive ]