Cryptology ePrint Archive: Report 2015/1036

Patterson-Wiedemann type functions on 21 variables with Nonlinearity greater than Bent Concatenation bound

Selcuk Kavut and Subhamoy Maitra

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 \times 3 = 15$ variables that are invariant under the actions of the cyclic group ${GF(2^5)}^\ast \cdot {GF(2^3)}^\ast$ as well as the group of Frobenius authomorphisms. Some of these Boolean functions posses nonlinearity greater than the bent concatenation bound. The next possible option for exploring such functions is on $7 \times 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.

Category / Keywords: foundations / Covering Radius, First Order Reed-Muller Code, Nonlinearity, Patterson-Wiedemann Type Functions

Date: received 26 Oct 2015, last revised 28 Oct 2015

Contact author: selcukkavut at gmail com

Available format(s): PDF | BibTeX Citation

Note: Revised version

Version: 20151028:092812 (All versions of this report)

Short URL: ia.cr/2015/1036

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]