Cryptographer's Toolkit for Construction of 8-Bit Bent Functions
Cryptographer's Toolkit for Construction of 8-Bit Bent Functions
复制标题
用于构建 8 位弯曲函数的密码学家工具包
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
G. Leander
中科院分区：
文献类型：
--
作者：
H. Dobbertin;G. Leander
布尔函数形成各种密码算法中的基本构建块。例如，它们被用作流密码中的过滤器。具有偶数个变量的极大非线性（必然非平衡）布尔函数称为bent函数。Bent函数可以被修改以得到平衡的高度非线性布尔函数。最近，第一作者已经证明了如何弯曲功能可以研究在递归框架中的某些整数值的功能。基于这种新的方法，我们描述了实际的系统建设的8位弯曲功能。我们还概述了如何计算所有8位bent函数的数量。
Boolean functions form basic building blocks in various cryptographic algorithms. They are used for instance as filters in stream ciphers. Maximally non-linear (necessarily non-balanced) Boolean functions with an even number of variables are called bent functions. Bent functions can be modified to get balanced highly non-linear Boolean functions. Recently the first author has demonstrated how bent functions can be studied in a recursive framework of certain integer-valued functions. Based on this new approach we describe the practical systematic construction of 8-bit bent functions. We outline also how to compute the number of all 8-bit bent functions.