A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity (Q540468)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity |
scientific article; zbMATH DE number 5903722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity |
scientific article; zbMATH DE number 5903722 |
Statements
A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity (English)
0 references
3 June 2011
0 references
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.
0 references
Boolean function
0 references
algebraic immunity
0 references
bent function
0 references
balancedness
0 references
nonlinearity
0 references
algebraic degree
0 references
0 references
0 references
0 references
0 references
0.90269476
0 references
0.9024274
0 references
0.9007811
0 references
0.8996097
0 references
0.8973139
0 references
0.8964896
0 references
