|
On the Bit-Slice representations of some nonlinear bijective transformations
O. C. Puente, R. F. Leal, R. A. de la Cruz Jiménez Institute of Cryptography, Havana University, Cuba
Abstract:
We study how to obtain efficient Bit-Slice representations in some classes of nonlinear bijective transformations having almost optimal cryptographic properties. For some 8-bit instances belonging to these classes, we determine (by combining analytical methods with a open source tool) its low gate count logic circuit representations through binary logic operations $\mathtt{AND, XOR, OR}$ and $\mathtt{NOT}$. In particular, for the S-Box used in the Russian cryptographic standard GOST R 34.12-2015 "Kuznyechik”, we derive a Bit-Slice implementation which consume a total of 176 binary logical operations. The new representation requires 51 Boolean operations less than in previously known one (that need 227 bitwise logical operations, see, for example, [1]).
Key words:
Bit-Slice, block cipher, nonlinear bijective transformation, S-Box, GOST R 34.12-2015 «Kuznyechik».
Received 18.V.2023
Citation:
O. C. Puente, R. F. Leal, R. A. de la Cruz Jiménez, “On the Bit-Slice representations of some nonlinear bijective transformations”, Mat. Vopr. Kriptogr., 15:1 (2024), 97–125
Linking options:
https://www.mathnet.ru/eng/mvk464https://doi.org/10.4213/mvk464 https://www.mathnet.ru/eng/mvk/v15/i1/p97
|
Statistics & downloads: |
Abstract page: | 102 | Full-text PDF : | 16 | References: | 18 | First page: | 7 |
|