You are looking at a specific version 20220302:142246 of this paper.
See the latest version.
Paper 2022/279
Permutation rotation-symmetric Sboxes, liftings and affine equivalence
Tron Omland and Pantelimon Stanica
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\leq n$. These functions generalize the well-known map used in the current Keccak hash function, which is generated via the Boolean function $x_1+x_1x_2+x_3$. We provide some general constructions, and also study the affine equivalence between rotation-symmetric Sboxes and describe the corresponding relationship between the Boolean function they are associated with. In the process, we point out some inaccuracies in the existing literature.
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- boolean functions
- Contact author(s)
- tron omland @ gmail com,pstanica @ nps edu
- History
- 2022-08-19: revised
- 2022-03-02: received
- See all versions
- Short URL
- https://ia.cr/2022/279
- License
-
CC BY