Search
Search Results
-
Combinatorial t-designs from special functions
A special function is a function either of special form or with a special property. Special functions have interesting applications in coding theory...
-
Transparency order for Boolean functions: analysis and construction
The notion of transparency order, proposed by Prouff (DPA attacks and S-boxes, FSE 2005, LNCS 3557, Springer, Berlin, 2005) and then redefined by...
-
Binary linear codes with few weights from Boolean functions
Boolean functions have very nice applications in coding theory and cryptography. In coding theory, Boolean functions have been used to construct...
-
Vectorial negabent concepts: similarities, differences, and generalizations
In Pasalic et al. (IEEE Trans Inf Theory 69:2702–2712, 2023), and in Anbar and Meidl (Cryptogr Commun 10:235–249, 2018), two different vectorial...
-
Multiple characters transforms and generalized Boolean functions
In this paper we investigate generalized Boolean functions whose spectrum is flat with respect to a set of Walsh-Hadamard transforms defined using...
-
On Symmetry and Differential Properties of Generalized Boolean Functions
In this paper we investigate various differential properties of generalized Boolean functions defined on... -
A Complete Characterization of Plateaued Boolean Functions in Terms of Their Cayley Graphs
In this paper we find a complete characterization of plateaued Boolean functions in terms of the associated Cayley graphs. Precisely, we show that a... -
Modified planar functions and their components
Zhou (J. Combin. Des. 21 (12), 563–584,
2013 ) introduced modified planar functions in order to describe (2 n , 2 n , 2 n , 1) relative difference sets R ... -
Generalized Bent Functions and Their Gray Images
In this paper we prove that generalized bent (gbent) functions defined on... -
Linear codes from a generic construction
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight...
-
Geometric and design-theoretic aspects of semibent functions II
This article is the successor of Dempwolff and Neumann (Des. Codes Cryptogr. 57:373–381,
2010 ). We now consider semibent functions with a linear... -
Tight Lower Bounds for Testing Linear Isomorphism
We study lower bounds for testing membership in families of linear/affine-invariant Boolean functions over the hypercube. Motivated by the recent... -
Geometric and design-theoretic aspects of semibent functions I
The two parts of this paper consider combinatorial and geometric aspects of semibent functions. In the first part of this note we obtain 2-designs...
-
On the Link of Some Semi-bent Functions with Kloosterman Sums
We extensively investigate the link between the semi- bentness property of some Boolean functions in polynomial forms and Kloosterman sums.