English
Related papers

Related papers: Some Results on Bent-Negabent Boolean Functions ov…

200 papers

We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these…

Information Theory · Computer Science 2012-05-31 Wei Su , Alexander Pott , Xiaohu Tang

Negabent functions as a class of generalized bent functions have attracted a lot of attention recently due to their applications in cryptography and coding theory. In this paper, we consider the constructions of negabent functions over…

Information Theory · Computer Science 2016-06-30 Gaofei Wu , Nian Li , Yuqing Zhang , Xuefeng Liu

Bent functions are maximally nonlinear Boolean functions with an even number of variables, which include a subclass of functions, the so-called hyper-bent functions whose properties are stronger than bent functions and a complete…

Information Theory · Computer Science 2024-07-03 Peng Han , Keli Pu

We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…

Combinatorics · Mathematics 2007-05-23 Sergey Agievich

Negabent Boolean functions are defined by having a flat magnitude spectrum under the nega-Hadamard transform. They exist in both even and odd dimensions, and the subclass of functions that are simultaneously bent and negabent…

Neural and Evolutionary Computing · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Ermes Franch , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

Bent functions as optimal combinatorial objects are difficult to characterize and construct. In the literature, bent idempotents are a special class of bent functions and few constructions have been presented, which are restricted by the…

Information Theory · Computer Science 2015-08-25 Chunming Tang , Yanfeng Qi , Zhengchun Zhou , Cuiling Fan

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 Pasalic et al., IEEE Trans. Inform. Theory 69 (2023), 2702--2712, and in Anbar, Meidl, Cryptogr. Commun. 10 (2018), 235--249, two different vectorial negabent and vectorial bent-negabent concepts are introduced, which leads to seemingly…

Combinatorics · Mathematics 2024-02-09 Nurdagül Anbar , Sadmir Kudin , Wilfried Meidl , Enes Pasalic , Alexandr Polujan

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

We study the nonlinearity of functions defined on a finite field with 2^m elements which are the trace of a polynomial of degree 7 or more general polynomials. We show that for m odd such functions have rather good nonlinearity properties.…

Number Theory · Mathematics 2007-05-23 Eric Férard , François Rodier

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he…

Information Theory · Computer Science 2012-05-08 Chunming Tang , Yanfeng Qi , Maozhi Xu , Baocheng Wang , Yixian Yang

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

A function $F:\mathbb{F}_2^n\rightarrow \mathbb{F}_2^n$, $n=2m$, can have at most $2^n-2^m$ bent component functions. Trivial examples are obtained as $F(x) = (f_1(x),\ldots,f_m(x),a_1(x),\ldots, a_m(x))$, where…

Number Theory · Mathematics 2020-10-09 Nurdagül Anbar , Tekgül Kalaycı , Wilfried Meidl , László Mérai

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

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

Let $\mathbb{F}_{p^{n}}$ be the finite field with $p^n$ elements and $\operatorname{Tr}(\cdot)$ be the trace function from $\mathbb{F}_{p^{n}}$ to $\mathbb{F}_{p}$, where $p$ is a prime and $n$ is an integer. Inspired by the works of…

Information Theory · Computer Science 2021-08-03 Xi Xie , Nian Li , Xiangyong Zeng , Xiaohu Tang , Yao Yao

Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by…

Discrete Mathematics · Computer Science 2025-07-29 Tor Helleseth , Alexander Kholosha , Niki Spithaki

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

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
‹ Prev 1 2 3 10 Next ›