34,911 research outputs found
Generalized bent Boolean functions and strongly regular Cayley graphs
In this paper we define the (edge-weighted) Cayley graph associated to a
generalized Boolean function, introduce a notion of strong regularity and give
several of its properties. We show some connections between this concept and
generalized bent functions (gbent), that is, functions with flat Walsh-Hadamard
spectrum. In particular, we find a complete characterization of quartic gbent
functions in terms of the strong regularity of their associated Cayley graph.Comment: 13 pages, 2 figure
Systematic Constructions of Bent-Negabent Functions, 2-Rotation Symmetric Bent-Negabent Functions and Their Duals
Bent-negabent functions have many important properties for their application
in cryptography since they have the flat absolute spectrum under the both
Walsh-Hadamard transform and nega-Hadamard transform. In this paper, we present
four new systematic constructions of bent-negabent functions on
and variables, respectively, by modifying the truth tables of two
classes of quadratic bent-negabent functions with simple form. The algebraic
normal forms and duals of these constructed functions are also determined. We
further identify necessary and sufficient conditions for those bent-negabent
functions which have the maximum algebraic degree. At last, by modifying the
truth tables of a class of quadratic 2-rotation symmetric bent-negabent
functions, we present a construction of 2-rotation symmetric bent-negabent
functions with any possible algebraic degrees. Considering that there are
probably no bent-negabent functions in the rotation symmetric class, it is the
first significant attempt to construct bent-negabent functions in the
generalized rotation symmetric class
Octal Bent Generalized Boolean Functions
In this paper we characterize (octal) bent generalized Boolean functions
defined on \BBZ_2^n with values in \BBZ_8. Moreover, we propose several
constructions of such generalized bent functions for both even and odd
Landscape Boolean Functions
In this paper we define a class of Boolean and generalized Boolean functions
defined on with values in (mostly, we consider
), which we call landscape functions (whose class containing generalized
bent, semibent, and plateaued) and find their complete characterization in
terms of their components. In particular, we show that the previously published
characterizations of generalized bent and plateaued Boolean functions are in
fact particular cases of this more general setting. Furthermore, we provide an
inductive construction of landscape functions, having any number of nonzero
Walsh-Hadamard coefficients. We also completely characterize generalized
plateaued functions in terms of the second derivatives and fourth moments.Comment: 19 page
- β¦