A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity (Q540468): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q122955093, #quickstatements; #temporary_batch_1711055989931 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q122955093 / rank | |||
Normal rank | |||
Revision as of 22:42, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity |
scientific article |
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
