Abstract
The first and the third authors recently introduced a spectral construction of plateaued and of 5-value spectrum functions. In particular, the design of the latter class requires a specification of integers , where , so that the sequence is a valid spectrum of a Boolean function (recovered using the inverse Walsh transform). Technically, this is done by allocating a suitable Walsh support , where corresponds to those for which . In addition, two dual functions (with ) are employed to specify the signs through for whereas for . In this work, two closely related problems are considered. Firstly, the specification of plateaued functions (duals) , which additionally satisfy the so-called totally disjoint spectra property, is fully characterized (so that is a spectrum of a Boolean function) when the Walsh support is given as a union of two disjoint affine subspaces . Especially, when plateaued dual functions themselves have affine Walsh supports, an efficient spectral design that utilizes arbitrary bent functions (as duals of ) on the corresponding ambient spaces is given. The problem of specifying affine inequivalent 5-value spectra functions is also addressed and an efficient construction method that ensures the inequivalence property is derived (sufficient condition being a selection of affine inequivalent duals). In the second part of this work, we investigate duals of plateaued functions with affine Walsh supports. For a given such plateaued function, we show that different orderings of its Walsh support which are employing the Sylvester-Hadamard recursion actually induce bent duals which are affine equivalent.
Publication
IEEE Transactions on Information Theory

Full Professor, Head of the center