English
Related papers

Related papers: Univariate Niho Bent Functions from o-Polynomials

200 papers

In this paper, the relation between binomial Niho bent functions discovered by Dobbertin et al. and o-polynomials that give rise to the Subiaco and Adelaide classes of hyperovals is found. This allows to expand the class of bent functions…

Combinatorics · Mathematics 2012-11-27 Tor Helleseth , Alexander Kholosha , Sihem Mesnager

In this paper, we obtain a new class of $p$-ary binomial bent functions which are determined by Kloosterman sums. The bentness of another three classes of functions is characterized by some exponential sums and some results in…

Information Theory · Computer Science 2014-04-14 L. Yu , H. Liu , D. Zheng

In this paper we study those bent functions which are linear on elements of spreads, their connections with ovals and line ovals, and we give descriptions of their dual bent functions. In particular, we give a geometric characterization of…

Combinatorics · Mathematics 2026-01-27 Kanat Abdukhalikov

Equivalence classes of Niho bent functions are described for all known types of hyperovals.

Combinatorics · Mathematics 2026-01-27 K. Abdukhalikov

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 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

We study a new method of constructing Boolean bent functions from cyclotomic mappings. Three generic constructions are obtained by considering different branch functions such as Dillon functions, Niho functions and Kasami functions over…

Number Theory · Mathematics 2023-10-03 Xi Xie , Nian Li , Qiang Wang , Xiangyong Zeng

Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…

Discrete Mathematics · Computer Science 2024-11-26 Ziran Tu , Sihem Mesnager , Xiangyong Zeng , Nian Li , Yupeng Jiang , Yanan Deng

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

The notion of o-polynomial comes from finite projective geometry. In 2011 and later, it has been shown that those objects play an important role in symmetric cryptography and coding theory to design bent Boolean functions, bent vectorial…

Information Theory · Computer Science 2017-09-13 Claude Carlet , Sihem Mesnager

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

Let K be the product O(n_1) x O(n_2) x ... x O(n_r) of orthogonal groups. Let V the r-fold tensor product of defining representations of each orthogonal factor. We compute a stable formula for the dimension of the K-invariant algebra of…

Representation Theory · Mathematics 2012-09-25 Lauren Kelly Williams

A bi-univalent function is a univalent function defined on the unit disk with its inverse also univalent on the unit disk. Estimates for the initial coefficients are obtained for bi-univalent functions belonging to certain classes defined…

Complex Variables · Mathematics 2013-03-01 S. Sivaprasad Kumar , Virendra Kumar , V. Ravichandran

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

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

A univalent meromorphic function defined on $\Delta:= \{z \in \mathbb{C}: 1<|z|<\infty \}$ with univalent inverse defined on $\Delta$ is bi-univalent meromorphic in $\Delta$. For certain subclasses of meromorphic bi-univalent functions,…

Complex Variables · Mathematics 2011-08-23 Suzeini Abd Halim , Samaneh G. Hamidi , V. Ravichandran

In this paper, a new construction of quaternary bent functions from quaternary quadratic forms over Galois rings of characteristic 4 is proposed. Based on this construction, several new classes of quaternary bent functions are obtained, and…

Discrete Mathematics · Computer Science 2013-09-03 Baofeng Wu , Dongdai Lin

In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…

Number Theory · Mathematics 2016-08-22 Jean-Pierre Flori

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

We present a construction of partial spread bent functions using subspaces generated by linear recurring sequences (LRS). We first show that the kernels of the linear mappings defined by two LRS have a trivial intersection if and only if…

Cryptography and Security · Computer Science 2021-12-17 Maximilien Gadouleau , Luca Mariot , Stjepan Picek
‹ Prev 1 2 3 10 Next ›