Bent函数的构造
The Construction of Bent Functions
DOI: 10.12677/pm.2026.1610206, PDF,    科研立项经费支持
作者: 董军武:广州大学数学与信息科学学院,广东 广州
关键词: Bent函数;半Bent函数;仿射函数;沿子空间级联;谱支撑;Bent Function; Semi Bent Function; Affine Function; Concatenation along Subspace; Spectral Support
摘要: Bent函数是非线性度达到最高的一类具有偶数个变量的布尔函数。一个熟知的结果是:f是n = 2k元Bent函数的充分必要条件是f由两个谱支撑互不相交的2k − 1元半Bent函数的级联而成。提出一个方法:用2k−1个标号互不相同的仿射函数,沿子空间级联,可得到2k − 1元半Bent函数,从而可以构造2k元Bent函数。并证明:当k = 1,2时,用这种方法可以得到所有的n = 2,4元Bent函数。
Abstract: Bent functions are a class of Boolean functions with even number of variables that have the highest degree of nonlinearity. A well-known result is that the sufficient and necessary condition for f to be a Bent function with n = 2k variables is that f is a concatenation of two semi Bent functions with 2k − 1 variables whose spectral support are disjoint. A method is proposed: by concatenating 2k−1 affine functions with different labels along a given subspace, we can construct a semi Bent function with 2k − 1 variables, and Bent functions with 2k variables can be obtained accordingly. We prove that: when k = 1, 2, all the Bent functions with 2 or 4 variables can be obtained in this way.
文章引用:董军武. Bent函数的构造[J]. 理论数学, 2026, 16(10): 1-13. https://doi.org/10.12677/pm.2026.1610206

参考文献

[1] Rothaus, O.S. (1976) On “Bent” Functions. Journal of Combinatorial Theory, Series A, 20, 300-305.
https://doi.org/10.1016/0097-3165(76)90024-8
[2] Carlet, C. (1991) A Transformation on Boolean Functions, Its Consequences on Some Problems Related to Reed-Muller Codes. In: Cohen, G. and Charpin, P., Eds., EUROCODE ‘90, Springer, 42-50.
https://doi.org/10.1007/3-540-54303-1_116
[3] Carlet, C. (1993) Partially-Bent Functions. Designs, Codes and Cryptography, 3, 135-145.
https://doi.org/10.1007/bf01388412
[4] Carlet, C. and Guillot, P. (1996) A Characterization of Binary Bent Functions. Journal of Combinatorial Theory, Series A, 76, 328-335.
https://doi.org/10.1006/jcta.1996.0110
[5] Carlet, C. (1994) Two New Classes of Bent Functions. In: Helleseth, T., Ed., Advances in Cryptology—EUROCRYPT ‘93, Springer, 77-101.
https://doi.org/10.1007/3-540-48285-7_8
[6] Dillon, J.F. (1974) Elementary Hadamard Difference Sets. Ph.D. Thesis, University of Maryland.
[7] Hou, X. and Langevin, P. (1997) Results on Bent Functions. Journal of Combinatorial Theory, Series A, 80, 232-246.
https://doi.org/10.1006/jcta.1997.2804
[8] 胡磊, 裴定一, 冯登国. 一类Bent函数的构造[J]. 中国科学院研究生院学报, 2002, 19(2): 103-106.
[9] 董军武, 王殊懿, 等. WDC算法与6元Bent函数计数[J]. 广州大学学报(自然科学版), 2024, 23(4): 56-66.
[10] Langevin, P. and Leander, G. (2011) Counting All Bent Functions in Dimension Eight 99270589265934370305785861242880. Designs, Codes and Cryptography, 59, 193-205.
https://doi.org/10.1007/s10623-010-9455-z