关键词: 线性复杂度 Bent函数 复杂系数

Abstract:

By using the linear complexity theory, a definition of the complexity-coetticient ot Boolean functions is proposed in this paper,and we conclude that  the linear complexity of any Boolean function is equal to its complexity-coefficient ;a fast algorithm for computing the polynomial form of Boolean func tions is given according to the complexity-coefficient. Furthermore,we discuss the properties of the linear complexity of Bent functions. Finally a nece  ssary condition for Bent functions is given.

Key words: （linear complexity, Bent function, complexity-coefficient）