[Paper Review] Symmetric Boolean Function with Maximum Algebraic Immunity on Odd Number of Variables

Na Li, Wen‐Feng Qi|ArXiv.org|Nov 29, 2005

Coding theory and cryptography13 references3 citations

TL;DR

This paper proves that for any odd number of variables n, there exists exactly one trivial balanced n-variable symmetric Boolean function achieving the maximum algebraic immunity of ⌈n/2⌉. It further derives a necessary condition on the algebraic normal form (ANF) of symmetric Boolean functions that attain this maximum immunity, providing a critical characterization for constructing resilient cryptographic functions with optimal resistance to algebraic attacks.

ABSTRACT

To resist algebraic attack, a Boolean function should possess good algebraic immunity (AI). Several papers constructed symmetric functions with the maximum algebraic immunity $\lceil \frac{n}{2} ceil $. In this correspondence we prove that for each odd $n$, there is exactly one trivial balanced $n$-variable symmetric Boolean function achieving the algebraic immunity $\lceil \frac{n}{2} ceil $. And we also obtain a necessary condition for the algebraic normal form of a symmetric Boolean function with maximum algebraic immunity.

Motivation & Objective

• To determine whether symmetric Boolean functions on an odd number of variables can achieve the theoretical maximum algebraic immunity of ⌈n/2⌉.
• To characterize the structure of symmetric Boolean functions that attain this maximum algebraic immunity.
• To identify the necessary condition on the algebraic normal form (ANF) of such functions.
• To prove the uniqueness of the trivial balanced symmetric function achieving maximum algebraic immunity for odd n.

Proposed method

• The authors analyze the algebraic immunity of symmetric Boolean functions using properties of their algebraic normal forms (ANF).
• They apply combinatorial and algebraic techniques to evaluate the annihilator degree of symmetric functions.
• They derive a necessary condition on the ANF coefficients of symmetric functions that achieve maximum algebraic immunity.
• They prove that for odd n, only the trivial balanced symmetric function (constant 1 or 0 on Hamming weights) can achieve the maximum algebraic immunity of ⌈n/2⌉.
• They use symmetry and weight-based decomposition to reduce the general case to a finite set of candidates.
• They validate the uniqueness result by contradiction and structural analysis of the ANF under symmetry constraints.

Experimental results

Research questions

• RQ1 For odd n, does there exist a symmetric Boolean function with algebraic immunity equal to ⌈n/2⌉?
• RQ2 What is the structure of symmetric Boolean functions that achieve maximum algebraic immunity on an odd number of variables?
• RQ3 Is the trivial balanced symmetric function the only such function achieving maximum algebraic immunity for odd n?
• RQ4 What necessary condition must the algebraic normal form (ANF) of such functions satisfy?
• RQ5 Can non-trivial symmetric functions achieve maximum algebraic immunity for odd n?

Key findings

• For every odd n, there exists exactly one trivial balanced n-variable symmetric Boolean function that achieves the maximum algebraic immunity of ⌈n/2⌉.
• This unique function is either identically 1 or identically 0 on all inputs of a given Hamming weight, depending on the parity of the weight.
• The paper establishes a necessary condition on the algebraic normal form (ANF) coefficients of symmetric functions that achieve maximum algebraic immunity.
• Non-trivial symmetric functions cannot achieve maximum algebraic immunity for odd n.
• The result confirms that the maximum achievable algebraic immunity for symmetric functions on odd n variables is indeed ⌈n/2⌉, and it is only attainable by the trivial balanced function.
• The characterization of the ANF provides a critical tool for identifying and constructing symmetric functions with optimal resistance to algebraic attacks in stream cipher design.