English
Related papers

Related papers: The combinatorial structure and value distribution…

200 papers

A function $F:\mathbb{F}_{p^n}\rightarrow \mathbb{F}_{p^m},$ is a vectorial $s$-plateaued function if for each component function $F_{b}(\mu)=Tr_n(\alpha F(x)), b\in \mathbb{F}_{p^m}^*$ and $\mu \in \mathbb{F}_{p^n}$, the Walsh transform…

Combinatorics · Mathematics 2018-07-31 Ayça Çeşmelioğlu , Oktay Olmez

Plateaued functions as an extension of bent functions play a significant role in cryptography, coding theory, sequences and combinatorics. In \cite{Mesnager9}, Mesnager \emph{et al.} introduced generalized plateaued functions in order to…

Information Theory · Computer Science 2022-03-31 Jiaxin Wang , Fang-Wei Fu

Boolean functions with few-valued spectra have wide applications in cryptography, coding theory, sequence designs, etc. In this paper, we further study the parametric construction approach to obtain balanced Boolean functions using…

Information Theory · Computer Science 2025-06-25 Qiancheng Zhang , Kangquan Li , Longjiang Qu

APN functions play a central role as building blocks in the design of many block ciphers, serving as optimal functions to resist differential attacks. One of the most important properties of APN functions is their linearity, which is…

Combinatorics · Mathematics 2026-05-19 Sophie Hannah Bénéteau , Nicolas Goluboff , Lukas Kölsch , Divyesh Vaghasiya

Whereas the design and properties of bent and plateaued functions have been frequently addressed during the past few decades, there are only a few design methods of so-called 5-valued spectra Boolean functions whose Walsh spectra takes the…

Information Theory · Computer Science 2018-11-29 S. Hodžić , E. Pasalic , W. G. Zhang

The design of plateaued functions over $GF(2)^n$, also known as 3-valued Walsh spectra functions (taking the values from the set $\{0, \pm 2^{\lceil \frac{n+s}{2} \rceil}\}$), has been commonly approached by specifying a suitable algebraic…

Information Theory · Computer Science 2018-11-13 S. Hodžić , E. Pasalic , Y. Wei , F. Zhang

In this paper, we study the value distributions of perfect nonlinear functions, i.e., we investigate the sizes of image and preimage sets. Using purely combinatorial tools, we develop a framework that deals with perfect nonlinear functions…

Combinatorics · Mathematics 2023-10-19 Lukas Kölsch , Alexandr Polujan

Two-to-one ($2$-to-$1$) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent functions. In this paper we provide a systematic study of…

Information Theory · Computer Science 2019-07-03 Sihem Mesnager , Longjiang Qu

In this article a procedure to construct bent functions from $\F_{p^n}$ to $\F_p$ by merging plateaued functions which are bent on ($n-2$)-dimensional subspaces of $\F_{p^n}$ is presented. Taking advantage of such classes of plateaued…

Number Theory · Mathematics 2013-10-31 Ayça Çeşmelioğlu , Wilfried Meidl

Functions with low differential uniformity have relevant applications in cryptography. Recently, functions with low $c$-differential uniformity attracted lots of attention. In particular, so-called APcN and PcN functions (generalization of…

Combinatorics · Mathematics 2021-02-05 Daniele Bartoli , Marco Calderini

In this paper, we focus on the links between Boolean function theory and quantum computing. In particular, we study the notion of what we call fully-balanced functions and analyse the Fourier--Hadamard and Walsh supports of those functions…

Combinatorics · Mathematics 2024-05-08 Claude Carlet , Ulises Pastor-Díaz , José María Tornero

In this paper, several new classes of Boolean functions with few Walsh transform values, including bent, semi-bent and five-valued functions, are obtained by adding the product of two or three linear functions to some known bent…

Information Theory · Computer Science 2015-06-17 Guangkui Xu , Xiwang Cao , Shanding Xu

Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…

Combinatorics · Mathematics 2025-01-28 Kirpa Garg , Sartaj Ul Hasan , Pantelimon Stanica

We consider image sets of differentially $d$-uniform maps of finite fields. We present a lower bound on the image size of such maps and study their preimage distribution, by extending methods used for planar maps. We apply the results to…

Combinatorics · Mathematics 2021-09-27 Lukas Kölsch , Björn Kriepke , Gohar M. Kyureghyan

We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of $F(x)=x^{2^e}h(\Tr_{2^{2m}/2^m}(x))$, where $e\geq0$ and $h(x)$ is a permutation over $\F_{2^m}$. If…

Information Theory · Computer Science 2023-06-01 Xianhong Xie , Yi Ouyang

The Walsh transform $\widehat{Q}$ of a quadratic function $Q:F_{p^n}\rightarrow F_p$ satisfies $|\widehat{Q}(b)| \in \{0,p^{\frac{n+s}{2}}\}$ for all $b\in F_{p^n}$, where $0\le s\le n-1$ is an integer depending on $Q$. In this article, we…

Number Theory · Mathematics 2016-03-16 Nurdagül Anbar , Wilfried Meidl , Alev Topuzoglu

Let $F$ be a function from $\mathbb{F}_{p^n}$ to itself and $\delta$ a positive integer. $F$ is called zero-difference $\delta$-balanced if the equation $F(x+a)-F(x)=0$ has exactly $\delta$ solutions for all non-zero $a\in\mathbb{F}_{p^n}$.…

Information Theory · Computer Science 2014-11-03 Claude Carlet , Guang Gong , Yin Tan

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

Information Theory · Computer Science 2022-12-12 Yue Yu , Pavel Loskot

The set of linear structures of most known balanced Boolean functions is nontrivial. In this paper, some balanced Boolean functions whose set of linear structures is trivial are constructed. We show that any APN function in even dimension…

Cryptography and Security · Computer Science 2019-09-26 Augustine Musukwa , Massimiliano Sala

In this paper, we mainly investigate profound interconnections between combinatorial designs, linear codes, and Boolean functions.

Information Theory · Computer Science 2026-05-26 Jong Yoon Hyun , Jieun Kwon , Jiaxin Wang , Yansheng Wu
‹ Prev 1 2 3 10 Next ›