A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity (Q540468): Difference between revisions

Based on a combinatorial conjecture on binary strings, the authors establish two classes of Boolean functions with algebraic immunity. The functions in the first class are bent, and it can be concluded that the algebraic immunity of bent functions can take all possible values except one. The functions in the second class are balanced, and they have optimal algebraic degree.