eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Minor revision. CTCrypt 2020 - 9th Workshop on Current Trends in Cryptology, September 15–17, 2020 Moscow region
- Keywords
- KuznyechikKhazadSPNLSXdifferential cryptanalysislinear cryptanalysisMEDPMELP
- Contact author(s)
- Vitaly Kiryukhin @ infotecs ru
- History
- 2021-04-15: revised
- 2020-10-06: received
- See all versions
- Short URL
- https://ia.cr/2020/1208
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1208,
author = {Vitaly Kiryukhin},
title = {An algorithm for bounding non-minimum weight differentials in 2-round LSX-ciphers},
howpublished = {Cryptology ePrint Archive, Paper 2020/1208},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/1208}},
url = {https://eprint.iacr.org/2020/1208}
}
