Abstract
The construction of Boolean functions with an odd number of variables and maximum algebraic immunity is studied in this paper. Starting with any function f obtained by the Carlet–Feng construction, we develop an efficient method to properly modify f in order to provide new functions having maximum algebraic immunity. This new approach, which exploits properties of the punctured Reed–Muller codes, suffices to generate a large number of new functions with maximum algebraic immunity through swapping an arbitrary number of elements between the support of f and its complement.
Cite
CITATION STYLE
Limniotis, K., & Kolokotronis, N. (2016). Boolean functions with maximum algebraic immunity based on properties of punctured reed–muller codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9540, pp. 3–16). Springer Verlag. https://doi.org/10.1007/978-3-319-29172-7_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
