Paper 2020/1208 Original: eprint.iacr.org/2020/1208 ↗
An algorithm for bounding non-minimum weight differentials in 2-round LSX-ciphers
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
- Preprint.
- History
- 2021-04-15: last updated
- 2020-10-06: published
- Short URL
- https://ia.cr/2020/1208
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2020/1208}
}