English
Related papers

Related papers: Generic constructions of 5-valued spectra Boolean …

200 papers

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

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

In this paper we define a class of Boolean and generalized Boolean functions defined on $\mathbb{F}_2^n$ with values in $\mathbb{Z}_q$ (mostly, we consider $q=2^k$), which we call landscape functions (whose class containing generalized…

Information Theory · Computer Science 2018-06-18 Constanza Riera , Pantelimon Stanica

The necessary and sufficient conditions for a class of functions $f:\mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is an even positive integer, have been recently identified for $q=4$ and $q=8$. In this article we give an…

Combinatorics · Mathematics 2016-02-01 S. Hodžić , E. Pasalic

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

We study combinatorial properties of plateaued functions $F \colon \mathbb{F}_p^n \rightarrow \mathbb{F}_p^m$. All quadratic functions, bent functions and most known APN functions are plateaued, so many cryptographic primitives rely on…

Combinatorics · Mathematics 2026-03-26 Lukas Kölsch , Alexandr Polujan

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

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

For cryptographic systems the method of confusion and diffusion is used as a fundamental technique to achieve security. Confusion is reflected in nonlinearity of certain Boolean functions describing the cryptographic transformation. In this…

Information Theory · Computer Science 2014-06-19 Xiwang Cao , Lei Hu

Bent-negabent functions have many important properties for their application in cryptography since they have the flat absolute spectrum under the both Walsh-Hadamard transform and nega-Hadamard transform. In this paper, we present four new…

Information Theory · Computer Science 2022-09-20 Fei Guo , Zilong Wang , Guang Gong

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

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

Generalized bent (gbent) functions from an $n$-variable Boolean space to $\mathbb{Z}_{2^k}$ are central in cryptography and sequence design. Instead of the usual binary decomposition, we introduce a $2^\ell$-adic representation, for $k=\ell…

Number Theory · Mathematics 2026-04-03 Ayça Çeşmelioğlu , Constanza Riera , Pantelimon Stănică

Evolving Boolean functions with specific properties is an interesting optimization problem since, depending on the combination of properties and Boolean function size, the problem can range from very simple to (almost) impossible to solve.…

Neural and Evolutionary Computing · Computer Science 2024-11-20 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

Information Theory · Computer Science 2007-07-13 Constanza Riera , Matthew G. Parker

Let $q=2^e$ with $e$ even, and let $\mathbb{F}_{q^2}$ be the finite field of order $q^2$. Put $d=(q^2+q+1)/3$, and consider the permutation polynomial $$\sigma(X)=X+X^d+X^{dq}\in\mathbb{F}_{q^2}[X].$$ For $\alpha\in\mathbb{F}_q^*$, define…

Number Theory · Mathematics 2026-03-31 Kaimin Cheng

In this paper we consider further applications of $(n,m)$-functions for the construction of 2-designs. For instance, we provide a new application of the extended Assmus-Mattson theorem, by showing that linear codes of APN functions with the…

Information Theory · Computer Science 2023-05-11 Wilfried Meidl , Alexandr A. Polujan , Alexander Pott

Bent functions are Boolean functions that are maximally nonlinear. They can be represented as bent squares, i.e., square matrices for which each row and each column is the Walsh spectrum of a Boolean function. Using this representation, it…

Combinatorics · Mathematics 2025-09-09 Jan Kristian Haugland

In this paper, we consider the problem of finding perfectly balanced Boolean functions with high non-linearity values. Such functions have extensive applications in domains such as cryptography and error-correcting coding theory. We provide…

Neural and Evolutionary Computing · Computer Science 2023-06-16 Bruno Gašperov , Marko Đurasević , Domagoj Jakobović

Recently, the Walsh spectrum and boomerang properties of special power functions have aroused widespread research interest, owing to their important applications in cryptography and information security. In particular, locally-APN functions…

Information Theory · Computer Science 2026-05-05 Yuehui Cui , Jinquan Luo , Can Xiang

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov
‹ Prev 1 2 3 10 Next ›