The existence of 9-variable Boolean functions having nonlinearity strictly greater than 240 has been shown very recently (May 2006) by Kavut, Maitra and Yucel; a few functions with nonlinearity 241 have been identified by a heuristic search in the class of Rotation Symmetric Boolean Functions (RSBFs). In this paper, using combinatorial results related to the Walsh spectra of RSBFs, we efficiently perform the exhaustive search to enumerate the 9-variable RSBFs having nonlinearity > 240 and found that there are 8 x 189 many functions with nonlinearity 241 and there is no RSBF having nonlinearity > 241. We further prove that among these functions, there are only two which are different up to the affine equivalence. This is found by utilizing t...
AbstractIn this paper we analyze the combinatorial properties related to the Walsh spectra of rotati...
AbstractRotation symmetric Boolean functions have been extensively studied in the last dozen years o...
Two Boolean functions are affine equivalent if one can be obtained from the other by applying an aff...
Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the b...
AbstractWe give a new lower bound to the covering radius of the first order Reed–Muller code RM(1,n)...
For the first time Boolean functions on 9 variables having nonlinearity 241 are discovered, that rem...
We introduce a steepest-descent-like search algorithm for the design of Boolean functions, yielding ...
For the first time we find Boolean functions on 9 variables having nonlinearity 241, that remained a...
The class of Rotation Symmetric Boolean Functions (RSBFs) has received serious attention in searchin...
The class of Rotation Symmetric Boolean Functions (RSBFs) has received serious attention recently i...
In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) ...
AbstractWe give a new lower bound to the covering radius of the first order Reed–Muller code RM(1,n)...
In this paper, we present theoretical constructions of Rotation Symmetric Boolean Functions (RSBFs) ...
AbstractRotation symmetric Boolean functions have important applications in the design of cryptograp...
Rotation symmetric Boolean functions have important applications in the design of cryptographic algo...
AbstractIn this paper we analyze the combinatorial properties related to the Walsh spectra of rotati...
AbstractRotation symmetric Boolean functions have been extensively studied in the last dozen years o...
Two Boolean functions are affine equivalent if one can be obtained from the other by applying an aff...
Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the b...
AbstractWe give a new lower bound to the covering radius of the first order Reed–Muller code RM(1,n)...
For the first time Boolean functions on 9 variables having nonlinearity 241 are discovered, that rem...
We introduce a steepest-descent-like search algorithm for the design of Boolean functions, yielding ...
For the first time we find Boolean functions on 9 variables having nonlinearity 241, that remained a...
The class of Rotation Symmetric Boolean Functions (RSBFs) has received serious attention in searchin...
The class of Rotation Symmetric Boolean Functions (RSBFs) has received serious attention recently i...
In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) ...
AbstractWe give a new lower bound to the covering radius of the first order Reed–Muller code RM(1,n)...
In this paper, we present theoretical constructions of Rotation Symmetric Boolean Functions (RSBFs) ...
AbstractRotation symmetric Boolean functions have important applications in the design of cryptograp...
Rotation symmetric Boolean functions have important applications in the design of cryptographic algo...
AbstractIn this paper we analyze the combinatorial properties related to the Walsh spectra of rotati...
AbstractRotation symmetric Boolean functions have been extensively studied in the last dozen years o...
Two Boolean functions are affine equivalent if one can be obtained from the other by applying an aff...