Cryptology ePrint Archive: Report 2020/1208

An algorithm for bounding non-minimum weight differentials in 2-round LSX-ciphers

Vitaly Kiryukhin

Abstract: This article describes some approaches to bounding non-minimum weight differentials (EDP) and linear hulls (ELP) in 2-round LSX-cipher. We propose a dynamic programming algorithm to solve this problem. For 2-round Kuznyechik the nontrivial upper bounds on all differentials (linear hulls) with $18$ and $19$ active Sboxes was obtained. These estimates are also holds for other differentials (linear hulls) with a larger number of active Sboxes. We obtain a similar result for 2-round Khazad. As a consequence, the exact value of the maximum expected differential (linear) probability (MEDP/MELP) was computed for this cipher.

Category / Keywords: secret-key cryptography / Kuznyechik, Khazad, SPN, LSX, differential cryptanalysis, linear cryptanalysis, MEDP, MELP

Original Publication (in the same form): CTCrypt 2020 - 9th Workshop on Current Trends in Cryptology, September 1517, 2020 Moscow region

Date: received 2 Oct 2020

Contact author: Vitaly Kiryukhin at infotecs ru

Available format(s): PDF | BibTeX Citation

Version: 20201006:093922 (All versions of this report)

Short URL: ia.cr/2020/1208


[ Cryptology ePrint archive ]