Article
A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables
Nat. Univ. of Defense Technol., ChangSha
IEEE Transactions on Information Theory (impact factor:
3.01).
09/2007;
DOI:10.1109/TIT.2007.901189
pp.2908 - 2910
Source: IEEE Xplore
-
Citations (0)
- Cited In (2)
-
Article: On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$
[show abstract] [hide abstract]
ABSTRACT: Algebraic immunity of Boolean function $f$ is defined as the minimal degree of a nonzero $g$ such that $fg=0$ or $(f+1)g=0$. Given a positive even integer $n$, it is found that the weight distribution of any $n$-variable symmetric Boolean function with maximum algebraic immunity $\frac{n}{2}$ is determined by the binary expansion of $n$. Based on the foregoing, all $n$-variable symmetric Boolean functions with maximum algebraic immunity are constructed. The amount is $(2\wt(n)+1)2^{\lfloor \log_2 n \rfloor}$11/2011; -
Conference Proceeding: An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity.
Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings; 01/2008
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed.
The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual
current impact factor.
Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence
agreement may be applicable.
Keywords
odd positive integer
