Search
Search Results
-
Characterizations and constructions of plateaued functions on finite abelian groups
Plateaued functions have been studied in many papers. They can be candidates for designing cryptographic functions and have been used to construct...
-
Cryptographic functions with interesting properties from CCZ-equivalence
In the last decades, because of their significantly important applications, a large number of papers were devoted to constructing cryptographic...
-
A general framework for secondary constructions of bent and plateaued functions
In this work, we employ the concept of composite representation of Boolean functions, which represents an arbitrary Boolean function as a composition...
-
On q-ary bent and plateaued functions
We obtain the following results. For any prime p the minimal Hamming distance between distinct regular p -ary bent functions of 2 n variables is equal...
-
A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where...
-
Generalized partially bent functions, generalized perfect arrays, and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting...
-
New characterizations of generalized Boolean functions
This paper focuses on providing the characteristics of generalized Boolean functions from a new perspective. We first generalize the classical...
-
-
A New Angle: On Evolving Rotation Symmetric Boolean Functions
Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean...
-
Explicit infinite families of bent functions outside the completed Maiorana–McFarland class
During the last five decades, many different secondary constructions of bent functions were proposed in the literature. Nevertheless, apart from a...
-
Further study on indecomposable cryptographic functions
The question related to (in)decomposition of functions has been addressed. We first corrected some results in [7].
Further, A generalized method to...
-
On APN Functions Whose Graphs are Maximal Sidon Sets
The graphs \(\mathcal{G}_F=\{(x,F(x)); x\in \mathbb {F}_2^n\}\)...
-
On those Boolean functions that are coset leaders of first order Reed-Muller codes
In this paper, we study the class of those Boolean functions that are coset leaders of first order Reed-Muller codes. We study their properties and...
-
Decomposing self-dual bent functions
Bent functions are Boolean functions in even number of variables that have maximal nonlinearity. They have flat Walsh–Hadamard spectrum and are of...
-
Heuristic search of (semi-)bent functions based on cellular automata
An interesting thread in the research of Boolean functions for cryptography and coding theory is the study of secondary constructions : given a known...
-
A survey on p-ary and generalized bent functions
Boolean bent functions have been introduced by Rothaus in 1966, bent functions in odd characteristic were first considered in 1985 by Kumar, Scholtz,...
-
Symbolic dynamics and rotation symmetric Boolean functions
We identify the weights w t ( f n ) of a family { f n } of rotation symmetric Boolean functions with the cardinalities of the sets of n -periodic points of a...
-
Autocorrelations of Vectorial Boolean Functions
Recently, Bar-On et al. introduced at Eurocrypt’19 a new tool, called the differential-linear connectivity table (DLCT), which allows for taking into...