Symmetric Boolean Function with Maximum Algebraic Immunity on Odd Number of Variables

Simple item page
dc.creatorLi, Na
dc.creatorQi, Wen-feng
dc.date2005-11-29
dc.date.accessioned2026-07-07T06:49:38Z
dc.date.available2026-07-07T06:49:38Z
dc.descriptionTo 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}\rceil $. 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}\rceil $. And we also obtain a necessary condition for the algebraic normal form of a symmetric Boolean function with maximum algebraic immunity.
dc.identifierhttps://arxiv.org/abs/cs/0511099
dc.identifierhttp://arxiv.org/abs/cs/0511099
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104425
dc.subjectCryptography and Security
dc.titleSymmetric Boolean Function with Maximum Algebraic Immunity on Odd Number of Variables
dc.typetext

Files

Collections

arXiv