Construction of correlation immune Boolean functions (Q4373628)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1107685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of correlation immune Boolean functions |
scientific article; zbMATH DE number 1107685 |
Statements
29 May 1998
0 references
correlation immune Boolean function
0 references
linear code
0 references
0.9310964345932008
0 references
0.9014042615890504
0 references
0.8927962183952332
0 references
Construction of correlation immune Boolean functions (English)
0 references
It is shown in this paper that every correlation immune Boolean function of \(n\) variables can be written as \(f(x)= g(xG^T)\), where \(g\) is an algebraic non-degenerate Boolean function of \(k\) \((k\leq n)\) variables and \(G\) is an generating matrix of an \([n,k,d]\) linear code. It is known that the correlation immunity of \(f(x)\) is at least \(d-1\). In this paper we further prove when the correlation immunity exceeds this lower bound. A method which can theoretically search exhaustively all possible correlation immune functions is proposed, while constructions of higher order correlation immune functions as well as algebraic nondegenerate correlation immune functions are discussed in particular. It is also shown that many cryptographic properties of \(g\) can be inherited by the correlation immune function \(f(x)= g(xG^T)\) which is an important property for choosing useful correlation immune functions. For the entire collection see [Zbl 0877.00018].
0 references