**Balanced Boolean Functions with (more than) Maximum Algebraic Immunity**

*Deepak Kumar Dalai and Subhamoy Maitra*

**Abstract: **In this correspondence, construction of balanced Boolean functions with maximum possible algebraic (annihilator) immunity (AI) is studied with an additional property which is necessary to resist fast algebraic attack. The additional property considered here is, given an $n$-variable ($n$ even) balanced function $f$ with maximum possible AI $\frac{n}{2}$, and given two $n$-variable Boolean functions $g, h$ such that $fg = h$, if $\deg(h) = \frac{n}{2}$, then $\deg(g)$ must be greater than or equal to $\frac{n}{2}$. Our results can also be used to present theoretical construction of resilient Boolean functions having maximum possible AI.

**Category / Keywords: **secret-key cryptography / Algebraic Attacks, Annihilators, Boolean Functions, Fast Algebraic Attacks.

**Date: **received 20 Nov 2006

**Contact author: **deepak_r at isical ac in

**Available format(s): **Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

**Version: **20061121:123344 (All versions of this report)

**Short URL: **ia.cr/2006/434

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]