Results on algebraic immunity for cryptographically significant boolean functions

  • Authors:
  • Deepak Kumar Dalai;Kishan Chand Gupta;Subhamoy Maitra

  • Affiliations:
  • Applied Statistics Unit, Indian Statistical Institute, Calcutta, India;Applied Statistics Unit, Indian Statistical Institute, Calcutta, India;Applied Statistics Unit, Indian Statistical Institute, Calcutta, India

  • Venue:
  • INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
  • Year:
  • 2004

Quantified Score

Hi-index 0.12

Visualization

Abstract

Recently algebraic attack has received a lot of attention in cryptographic literature. It has been observed that a Boolean function f, interpreted as a multivariate polynomial over GF(2), should not have low degree multiples when used as a cryptographic primitive. In this paper we show that high nonlinearity is a necessary condition to resist algebraic attack and explain how the Walsh spectra values are related to the algebraic immunity (resistance against algebraic attack) of a Boolean function. Next we present enumeration results on linearly independent annihilators. We also study certain classes of highly nonlinear resilient Boolean functions for their algebraic immunity.