布尔函数设计中的爬山算法及其改进

Improved hill-climbing methods in the design of Boolean function

针对布尔函数设计中的爬山算法,分析了算法中集合W_(2,3)^+与W_(2,3)^-的性质,优化了该算法的部分计算。通过分析布尔函数自身的局部性质,提出了改进的爬山算法。实验数据表明:新的算法可以找到非线性度更高的布尔函数。

The hill climbing method in the design of Boolean functions was considered, By analyzing some properties of the sets W2,3^＋ and W2,3^-, some steps of the original hill climbing method was reduced. By analyzing some local properties of the nonlinearity of Boolean function, an improved hill climbing method which can find Boolean functions with higher nonlinearity than the old one was given.