Paper 2022/279 Original: eprint.iacr.org/2022/279 ↗
Permutation rotation-symmetric S-boxes, liftings and affine equivalence
Abstract
In this paper, we investigate permutation rotation-symmetric (shift-invariant) vectorial Boolean functions on n bits that are liftings from Boolean functions on k bits, for k≤n. These functions generalize the well-known map used in the current Keccak hash function, which is generated via the Boolean function on 3 variables, x1+(x2+1)x3. We provide some general constructions, and also study the affine equivalence between rotation-symmetric S-boxes and describe the corresponding relationship between the Boolean function they are associated with.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2022-08-19: last updated
- 2022-03-02: published
- Short URL
- https://ia.cr/2022/279
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/279,
author = {Tron Omland and Pantelimon Stanica},
title = {Permutation rotation-symmetric S-boxes, liftings and affine equivalence},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/279},
year = {2022},
url = {https://eprint.iacr.org/2022/279}
}