Paper 2013/585

On Algebraic Immunity of Trace Inverse Functions over Finite Fields with Characteristic Two

Xiutao Feng and Guang Gong

Abstract

The trace inverse function $\text{Tr}(\lambda x^{-1})$ over the finite field ${\mathbb{F}}_{2^n}$ is a class of very important Boolean functions and has be used in many stream ciphers, for example, SFINKS, RAKAPOSHI, the simple counter stream cipher presented by W. Si and C.S. Ding, etc. In order to evaluate the security of those algorithms in assistance to (fast) algebraic attacks, it is essential to algebraic properties of $\text{Tr}(\lambda x^{-1})$. However, currently only some bounds on algebraic immunity of $\text{Tr}(\lambda x^{-1})$ are given in public literature. In this work we give the exact value of $\text{Tr}(\lambda x^{-1})$ over finite fields ${\mathbb{F}}_{2^n}$, that is, $\text{AI}(\text{Tr}(\lambda x^{-1}))=\text{floor}\sqrt{n}+\text{ceil}\frac{n}{\text{floor}\sqrt{n}}-2=\text{ceil}2\sqrt{n}-2$, where $n\ge 2$, $\lambda \in {\mathbb{F}}_{2^n}$ and $\lambda \ne 0$, which is just the upper bound given by Y. Nawaz et al. And at the same time our result shows that D.K. Dalai' conjecture on the algebraic immunity of $\text{Tr}(\lambda x^{-1})$ is correct. What is more, we further demonstrate some weak properties of $$ in resistance to fast algebraic attacks.