Patterson-wiedemann type functions on 21 variables with nonlinearity greater than bent concatenation bound

Article Type

Research Article

Publication Title

IEEE Transactions on Information Theory

Abstract

Nonlinearity is one of the most challenging combinatorial property in the domain of Boolean function research. Obtaining nonlinearity greater than the bent concatenation bound for odd number of variables continues to be one of the most sought after combinatorial research problems. The pioneering result in this direction has been discovered by Patterson and Wiedemann in 1983 (IEEE-IT), which considered Boolean functions on 5 × 3 = 15 variables that are invariant under the actions of the cyclic group GF(25)∗.GF(23)∗ as well as the group of Frobenius automorphisms. Some of these Boolean functions possess nonlinearity greater than the bent concatenation bound. The next possible option for exploring such functions is on 7 × 3 = 21 variables. However, obtaining such functions remained elusive for more than three decades even after substantial efforts as evident in the literature. In this paper, we exploit combinatorial arguments together with heuristic search to demonstrate such functions for the first time.

First Page

2277

Last Page

2282

DOI

10.1109/TIT.2016.2530795

Publication Date

4-1-2016

Link to Full Text

Share

COinS