Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity

Simple item page
dc.creatorLi, Na
dc.creatorQi, Wen-Feng
dc.date2006-05-30
dc.date.accessioned2026-07-07T07:09:36Z
dc.date.available2026-07-07T07:09:36Z
dc.descriptionAlgebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an $n$-variable Boolean function is upper bounded by $\left\lceil {\frac{n}{2}} \right\rceil $. In this paper, for an odd integer $n$, we present a construction method which can efficiently generate a Boolean function of $n$ variables with maximum algebraic immunity, and we also show that any such function can be generated by this method. Moreover, the number of such Boolean functions is greater than $2^{2^{n-1}}$.
dc.descriptionThis paper has been submitted on March 9, 2006
dc.identifierhttps://arxiv.org/abs/cs/0605139
dc.identifierhttp://arxiv.org/abs/cs/0605139
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111129
dc.subjectCryptography and Security
dc.titleConstruction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity
dc.typetext

Files

Collections

arXiv