|
This article is cited in 9 scientific papers (total in 10 papers)
New classes of $8$-bit permutations based on a butterfly structure
D. B. Fomin Technical Committee for Standardization
“Cryptography and security mechanisms” (TC 26), Moscow, Russia
Abstract:
New classes of $8$-bit permutation based on a butterfly structure are introduced. These classes set up a new way for generating $2n$-bit permutation from $n$-bit ones. We introduce some classes that contain permutations with good cryptographic properties and could be efficiently implemented for hardware and software applications.
Key words:
Boolean function, $\mathrm{S}$-box, butterfly structure, bent function.
Received 06.II.2018
Citation:
D. B. Fomin, “New classes of $8$-bit permutations based on a butterfly structure”, Mat. Vopr. Kriptogr., 10:2 (2019), 169–180
Linking options:
https://www.mathnet.ru/eng/mvk294https://doi.org/10.4213/mvk294 https://www.mathnet.ru/eng/mvk/v10/i2/p169
|
Statistics & downloads: |
Abstract page: | 689 | Full-text PDF : | 223 | References: | 65 | First page: | 20 |
|