Nowadays, ciphers have been widely used in high-end platforms, resource-constrained, and side-channel attacks vulnerable environments. This motivates various S-boxes aimed at providing a good trade-off between security and efficiency. For small S-boxes, the most natural approach of constructing such S-boxes is a comprehensive search in the space of permutations, which inevitably becomes more challenging when the size grows. For large S-boxes (e.g., 8-bit), previous works concentrated on creations from finite fields or smaller ones (e.g., 4-bit). This paper proposes a new algorithm with a layered structure to search for 8-bit SKINNY-like S-boxes. We compare our new S-box with the original 8-bit SKINNY S-box by analyzing its security properties. Besides, due to our searching algorithm’s rules and constraints, SKINNY-like S-boxes have other features of lightweight implementation, low multiplicative complexity, low AND depth, and an effective inverse. Eventually, the searching algorithm outputs 224000 8-bit SKINNY-like S-boxes. The cipher designers can use these new S-boxes to construct lightweight block ciphers with easy-to-mask property and efficient implementation performance.

如今，密码已广泛用于高端平台，资源受限和侧通道攻击易受攻击的环境中。这激发了各种旨在在安全性和效率之间做出良好折衷的S-box。对于小型S形盒，构造此类S形盒的最自然的方法是在排列空间内进行全面搜索，这不可避免地会随着大小的增长而变得更具挑战性。对于大型S盒（例如8位），以前的工作主要集中在有限域或更小的字段（例如4位）上。本文提出了一种具有分层结构的新算法来搜索类似于SKINNY的8位S盒。我们将新的S-box与原始的8位SKINNY进行了比较通过分析S-box的安全性属性。此外，由于我们搜索算法的规则和约束，类似SKINNY的S盒还具有轻量级实现，低乘法复杂度，低AND深度和有效逆的其他特征。最终，搜索算法输出224000个类似SKINNY的8位S-box。密码设计者可以使用这些新的S-box构造具有易于屏蔽的属性和高效的实现性能的轻量级分组密码。