English
Related papers

Related papers: Vectorial Negabent Concepts: Similarities, Differe…

200 papers

It is known that partial spreads is a class of bent partitions. In \cite{AM2022Be,MP2021Be}, two classes of bent partitions whose forms are similar to partial spreads were presented. In \cite{AKM2022Ge}, more bent partitions $\Gamma_{1},…

Information Theory · Computer Science 2023-01-03 Jiaxin Wang , Fang-Wei Fu , Yadi Wei

In this paper, we study different cryptographically significant spectra of Boolean functions, including the Walsh-Hadamard, cross-correlation, and autocorrelation. The $2^k$-variation by Stanica [IEEE-IT 2016] is considered here with the…

Quantum Physics · Physics 2025-07-11 Suman Dutta , Subhamoy Maitra , Pantelimon Stanica

Starting from special near-bent functions in dimension 2t-1 we construct bent functions in dimension 2t having a specific derivative. We deduce new famillies of bent functions

Information Theory · Computer Science 2014-05-23 Jacques Wolfmann

We provide constructions of bent functions using triples of permutations. This approach is due to Mesnager. In general, involutions have been mostly considered in such a machinery; we provide some other suitable triples of permutations,…

Combinatorics · Mathematics 2019-07-10 Daniele Bartoli , Maria Montanucci , Giovanni Zini

Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean functions. At the same time, the functions in this class can have excellent properties, making…

Neural and Evolutionary Computing · Computer Science 2023-11-21 Claude Carlet , Marko Ðurasevic , Bruno Gašperov , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

Bent functions are balanced by restricting their domains to vectors with either even or odd Hamming weights, which ensures an equal number of pre-images for both, 0 and 1. Using the previous fact, we can construct bent functions on two…

General Mathematics · Mathematics 2025-08-27 Juan Carlos Ku-Cauich , Javier Arturo Díaz-Vargas , Sara Mandujano-Velazquez

Vector representations of graphs and relational structures, whether hand-crafted feature vectors or learned representations, enable us to apply standard data analysis and machine learning techniques to the structures. A wide range of…

Machine Learning · Computer Science 2020-03-31 Martin Grohe

Negation is an important perspective of knowledge representation. Existing negation methods are mainly applied in probability theory, evidence theory and complex evidence theory. As a generalization of evidence theory, random permutation…

Artificial Intelligence · Computer Science 2024-03-14 Yongchuan Tang , Rongfei Li

Let $m$ be an even positive integer. A Boolean bent function $f$ on $\GF{m-1} \times \GF {}$ is called a \emph{cyclic bent function} if for any $a\neq b\in \GF {m-1}$ and $\epsilon \in \GF{}$, $f(ax_1,x_2)+f(bx_1,x_2+\epsilon)$ is always…

Information Theory · Computer Science 2018-11-20 Cunsheng Ding , Sihem Mesnager , Chunming Tang , Maosheng Xiong

In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form $f(x)=\sum_{i=1}^{\frac{m}{2}-1} Tr^n_1(c_ix^{1+2^{ei}})+ Tr_1^{n/2}(c_{m/2}x^{1+2^{n/2}}) ,$ where $n=me$, $m$ is even and $c_i\in…

Information Theory · Computer Science 2013-08-14 Chunming Tang , Yanfeng Qi

For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of Boolean functions. The {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable…

Combinatorics · Mathematics 2019-05-02 Zhixiong Chen , Andrew Klapper

An important classification of permutations over $\mathbb{F}_2^m$, suitable for constructing Maiorana-McFarland bent functions on $\mathbb{F}_2^m \times \mathbb{F}_2^m$ with the unique $M$-subspace of maximal dimension, was recently…

Combinatorics · Mathematics 2025-08-21 Sadmir Kudin , Enes Pasalic , Alexandr Polujan , Fengrong Zhang

It has been an active research issue for many years to construct new bent functions. For $k$ odd with $\gcd(n, k)=1$, and $a\in\mathbb{F}_{3^n}^{*}$, the function $f(x)=Tr(ax^{\frac{3^k+1}{2}})$ is weakly regular bent over…

Information Theory · Computer Science 2017-07-18 Honggang Hu , Xiaolong Yang , Shaohua Tang

Various miscellaneous functional inequalities are deduced for the so-called generalized inverse trigonometric and hyperbolic functions. For instance, functional inequalities for sums, difference and quotient of generalized inverse…

Classical Analysis and ODEs · Mathematics 2014-04-23 Árpád Baricz , Barkat Ali Bhayo , Tibor K. Pogány

We obtain new nonexistence results for two classes of generalized bent functions from $\mathbb{Z}_{q}^{n}$ to $\mathbb{Z}_{q}$, called type $[n,q]$ generalized bent functions. The first class concerns the case $q=2 p_1^{e_1} p_2^{e_2}$,…

Combinatorics · Mathematics 2026-05-26 Shi Ying , Yingpu Deng

In this paper we define a new transform on (generalized) Boolean functions, which generalizes the Walsh-Hadamard, nega-Hadamard, $2^k$-Hadamard, consta-Hadamard and all $HN$-transforms. We describe the behavior of what we call the root-…

Information Theory · Computer Science 2019-07-23 Luis A. Medina , Matthew G. Parker , Constanza Riera , Pantelimon Stanica

In this work, we employ the concept of {\em composite representation} of Boolean functions, which represents an arbitrary Boolean function as a composition of one Boolean function and one vectorial function, for the purpose of specifying…

Information Theory · Computer Science 2018-09-21 S. Hodžić , E. Pasalic , Y. Wei

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

Let $G$ be a finite abelian group acting faithfully on a finite set $X$. As a natural generalization of the perfect nonlinearity of Boolean functions, the $G$-bentness and $G$-perfect nonlinearity of functions on $X$ are studied by Poinsot…

Discrete Mathematics · Computer Science 2014-06-18 Yun Fan , Bangteng Xu

Let $F$ be a vectorial Boolean function from $\mathbb{F}_2^n$ to $\mathbb{F}_2^m$, with $m \geq n$. We define $F$ as an embedding if $F$ is injective. In this paper, we examine the component functions of $F$, focusing on constant and…

Cryptography and Security · Computer Science 2025-05-29 Augustine Musukwa , Massimiliano Sala