14 research outputs found
On a conjecture of Helleseth
We are concern about a conjecture proposed in the middle of the seventies by
Hellesseth in the framework of maximal sequences and theirs cross-correlations.
The conjecture claims the existence of a zero outphase Fourier coefficient. We
give some divisibility properties in this direction
On the Systematic Constructions of Rotation Symmetric Bent Functions with Any Possible Algebraic Degrees
In the literature, few constructions of -variable rotation symmetric bent
functions have been presented, which either have restriction on or have
algebraic degree no more than . In this paper, for any even integer
, a first systemic construction of -variable rotation symmetric
bent functions, with any possible algebraic degrees ranging from to , is
proposed
Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
In this paper, a technique on constructing nonlinear resilient Boolean
functions is described. By using several sets of disjoint spectra functions on
a small number of variables, an almost optimal resilient function on a large
even number of variables can be constructed. It is shown that given any ,
one can construct infinitely many -variable ( even), -resilient
functions with nonlinearity . A large class of highly
nonlinear resilient functions which were not known are obtained. Then one
method to optimize the degree of the constructed functions is proposed. Last,
an improved version of the main construction is given.Comment: 14 pages, 2 table
Patterson-Wiedemann type functions on 21 variables with Nonlinearity greater than Bent Concatenation bound
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 variables that are invariant under the actions of the cyclic group 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 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