论文标题
置换旋转对称的S盒，升降机和仿射等价
Permutation rotation-symmetric S-boxes, liftings and affine equivalence
论文作者
论文摘要
在本文中，我们调查了置换旋转对称（Shift-Invariant）矢量布尔函数的$ n $位，这些功能是$ k $ bits in Boolean函数的抬起，以$ k \ leq n $。这些函数概括了当前Keccak哈希功能中使用的众所周知的地图，该函数是通过布尔函数生成的，$ 3 $变量，$ x_1+（x_2+1）x_3 $。我们提供了一些通用的结构，还研究了旋转对称S框之间的仿射等效性，并描述了与之相关的布尔函数之间的相应关系。
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 on $3$ variables, $x_1+(x_2+1)x_3$. 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.
