15,534 research outputs found
Strongly regular graphs from weakly regular plateaued functions
The paper provides the first constructions of strongly regular graphs and
association schemes from weakly regular plateaued functions over finite fields
of odd characteristic. We generalize the construction method of strongly
regular graphs from weakly regular bent functions given by Chee et al. in
[Journal of Algebraic Combinatorics, 34(2), 251-266, 2011] to weakly regular
plateaued functions. In this framework, we construct strongly regular graphs
with three types of parameters from weakly regular plateaued functions with
some homogeneous conditions. We also construct a family of association schemes
of class p from weakly regular p-ary plateaued functions
A construction of bent functions from plateaued functions
In this presentation, a technique for constructing bent functions from plateaued functions is introduced and analysed. This generalizes earlier techniques for constructing bent from near-bent functions. Using this construction, we obtain a big variety of inequivalent bent functions, some weakly regular and some non-weakly regular. Classes of bent function with some additional properties that enable the construction of strongly regular graphs are constructed, and explicit expressions for bent functions with maximal degree are presented
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
A new class of three-weight linear codes from weakly regular plateaued functions
Linear codes with few weights have many applications in secret sharing
schemes, authentication codes, communication and strongly regular graphs. In
this paper, we consider linear codes with three weights in arbitrary
characteristic. To do this, we generalize the recent contribution of Mesnager
given in [Cryptography and Communications 9(1), 71-84, 2017]. We first present
a new class of binary linear codes with three weights from plateaued Boolean
functions and their weight distributions. We next introduce the notion of
(weakly) regular plateaued functions in odd characteristic and give
concrete examples of these functions. Moreover, we construct a new class of
three-weight linear -ary codes from weakly regular plateaued functions and
determine their weight distributions. We finally analyse the constructed linear
codes for secret sharing schemes.Comment: The Extended Abstract of this work was submitted to WCC-2017 (the
Tenth International Workshop on Coding and Cryptography
Secondary constructions of (non)weakly regular plateaued functions over finite fields
Plateaued (vectorial) functions over finite fields have diverse applications in symmetric cryptography, coding theory, and sequence theory. Constructing these functions is an attractive research topic in the literature. We can distinguish two kinds of constructions of plateaued functions: secondary constructions and primary constructions. The first method uses already known functions to obtain new functions while the latter do not need to use previously constructed functions to obtain new functions. In this work, the first secondary constructions of (non)weakly regular plateaued (vectorial) functions are presented over the finite fields of odd characteristics. We also introduce some recursive constructions of (non)weakly regular plateaued p-ary functions by using already known such functions. We obtain nontrivial plateaued functions from the previously known trivial plateaued (partially bent) functions in the proposed construction methods
- …