Answers are grounded in this paper and cite their sources.
In this correspondence, we introduce a method to construct Boolean functions in any number of variables, with optimal algebraic immunity. Remarkably, all functions of this type with an odd number of variables can be obtained in this way. We study some cryptographic properties, such as balancedness, algebraic degree of the constructed functions. Moreover, a lower bound of the number of Boolean functions with optimal algebraic immunity is given.
No takes yet. Share an insight, caveat, or question.
Li et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: