论文信息 - Finding Differential Paths in ARX Ciphers through Nested Monte-Carlo Search

Finding Differential Paths in ARX Ciphers through Nested Monte-Carlo Search

We propose the adaptation of Nested Monte-Carlo Search algorithm for finding differential trails in the class of ARX ciphers. The practical application of the algorithm is demonstrated on round-reduced variants of block ciphers from the SPECK family. More specifically, we report the best differential trails,up to 9 rounds, for SPECK32.

[1] Alex Biryukov,et al. Automatic Search for Differential Trails in ARX Ciphers , 2014, CT-RSA.

[2] Stefan Lucks,et al. The Skein Hash Function Family , 2009 .

[3] Demis Hassabis,et al. Mastering the game of Go with deep neural networks and tree search , 2016, Nature.

[4] Jason Smith,et al. The SIMON and SPECK Families of Lightweight Block Ciphers , 2013, IACR Cryptol. ePrint Arch..

[5] Josh Benaloh,et al. Topics in Cryptology – CT-RSA 2020: The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings , 2020, CT-RSA.

[6] Alex Biryukov,et al. Automatic Search for the Best Trails in ARX: Application to Block Cipher Speck , 2016, FSE.

[7] Tristan Cazenave,et al. Nested Monte-Carlo Search , 2009, IJCAI.