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...
-
Several Classes of Niho Type Boolean Functions with Few Walsh Transform Values
Boolean functions with n variables are functions from \(\mathbb {f}_{2^n}\)...
-
Boolean Functions with a Few Walsh Transform Values
Boolean functions have been extensively studied in coding theory, cryptography, sequence design and graph theory. By adding two products of three...
-
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...
-
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...
-
On the Algebraic Immunity of Weightwise Perfectly Balanced Functions
In this article we study the Algebraic Immunity (AI) of Weightwise Perfectly Balanced (WPB) functions. After showing a lower bound on the AI of two...
-
Further projective binary linear codes derived from two-to-one functions and their duals
Binary linear codes with few weights have wide applications in communication, secret sharing schemes, authentication codes, association schemes,...
-
Cooperative coati optimization algorithm with transfer functions for feature selection and knapsack problems
Coatis optimization algorithm (COA) has recently emerged as an innovative meta-heuristic algorithm (MA) for global optimization, garnering...
-
Frobenius linear translators giving rise to new infinite classes of permutations and bent functions
We show the existence of many infinite classes of permutations over finite fields and bent functions by extending the notion of linear translators,...
-
Introducing nega-Forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra
Aaronson defined Forrelation (2010) as a measure of correlation between a Boolean function f and the Walsh–Hadamard transform of another function
... 
-
On the boomerang uniformity of quadratic permutations
At Eurocrypt’18, Cid, Huang, Peyrin, Sasaki, and Song introduced a new tool called Boomerang Connectivity Table (BCT) for measuring the resistance of...
-
On APN Functions Whose Graphs are Maximal Sidon Sets
The graphs \(\mathcal{G}_F=\{(x,F(x)); x\in \mathbb {F}_2^n\}\)...
-
Some conditions for absence of affine functions in NFSR output stream
Nonlinear feedback shift registers (NFSR) are widely used in cryptography as the source of pseudo-random sequences used in ciphers. The nature of the...
-
A new lower bound on the second-order nonlinearity of a class of monomial bent functions
The second-order nonlinearity can provide knowledge on classes of Boolean functions used in symmetric-key cryptosystems, coding theory, and Gowers...
-
New sets of non-orthogonal spreading sequences with low correlation and low PAPR using extended Boolean functions
Extended Boolean functions (EBFs) are one of the most important tools in cryptography and spreading sequence design in communication systems. In this...