### Partitions in the S-Box of Streebog and Kuznyechik

Léo Perrin

##### Abstract

Streebog and Kuznyechik are the latest symmetric cryptographic primitives standardized by the Russian GOST. They share the same S-Box, $\pi$, whose design process was not described by its authors. In previous works, Biryukov, Perrin and Udovenko recovered two completely different decompositions of this S-Box. We revisit their results and identify a third decomposition of $\pi$. It is an instance of a fairly small family of permutations operating on $2m$ bits which we call TKlog and which is closely related to finite field logarithms. Its simplicity and the small number of components it uses lead us to claim that it has to be the structure intentionally used by the designers of Streebog and Kuznyechik. The $2m$-bit permutations of this type have a very strong algebraic structure: they map multiplicative cosets of the subfield $\mathbb{F}_{2^{m}}^{*}$ to additive cosets of $\mathbb{F}_{2^{m}}^{*}$. Furthermore, the function relating each multiplicative coset to the corresponding additive coset is always essentially the same. To the best of our knowledge, we are the first to expose this very strong algebraic structure. We also investigate other properties of the TKlog and show in particular that it can always be decomposed in a fashion similar to the first decomposition of Biryukov et al., thus explaining the relation between the two previous decompositions. It also means that it is always possible to implement a TKlog efficiently in hardware and that it always exhibits a visual pattern in its LAT similar to the one present in $\pi$. While we could not find attacks based on these new results, we discuss the impact of our work on the security of Streebog and Kuznyechik. To this end, we provide a new simpler representation of the linear layer of Streebog as a matrix multiplication in the exact same field as the one used to define $\pi$. We deduce that this matrix interacts in a non-trivial way with the partitions preserved by $\pi$.

Available format(s)
Category
Secret-key cryptography
Publication info
Keywords
Boolean functionsKuznyechikStreebogReverse-EngineeringPartitionsCosetsTKlog
Contact author(s)
leo perrin @ inria fr
History
Short URL
https://ia.cr/2019/092

CC BY

BibTeX

@misc{cryptoeprint:2019/092,
author = {Léo Perrin},
title = {Partitions in the S-Box of Streebog and Kuznyechik},
howpublished = {Cryptology ePrint Archive, Paper 2019/092},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/092}},
url = {https://eprint.iacr.org/2019/092}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.