On Communication Complexity of Bent Functions from Maiorana-McFarland Class

Abstract

In this article we study two party Communication Complexity of Boolean bent functions from Maiorana-McFarland class. In particular, we describe connections between Maiorana-McFarland construction of bent functions and operations on matrix form of Boolean functions and show that bent functions of 2n variables from Maiorana-McFarland class have deterministic communication complexity equal n + 1. Finally, we show that not all bent functions have high communication complexity lower bound by giving the example of such function.