English
Related papers

Related papers: On constructing bent functions from cyclotomic map…

200 papers

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

In this paper, we discover that any univariate Niho bent function is a sum of functions having the form of Leander-Kholosha bent functions with extra coefficients of the power terms. This allows immediately, knowing the terms of an…

Discrete Mathematics · Computer Science 2014-11-11 Lilya Budaghyan , Alexander Kholosha , Claude Carlet , Tor Helleseth

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

The generalized cyclotomic mappings over finite fields $\mathbb{F}_{q}$ are those mappings which induce monomial functions on all cosets of an index $\ell$ subgroup $C_0$ of the multiplicative group $\mathbb{F}_{q}^{*}$. Previous research…

Information Theory · Computer Science 2025-03-11 Yanbin Zheng , Yang Zhang , Zhengbang Zha , Xiangyong Zeng , Qiang Wang

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

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

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

In this paper, we propose a new construction of quadratic bent functions in polynomial forms. Right Euclid algorithm in skew-polynomial rings over finite fields of characteristic 2 is applied in the proof.

Cryptography and Security · Computer Science 2016-05-11 Baofeng Wu , Jia Zheng , Zhuojun Liu

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

Let $n$ be an even positive integer, and $m<n$ be one of its positive divisors. In this paper, inspired by a nice work of Tang et al. on constructing large classes of bent functions from known bent functions [27, IEEE TIT, 63(10):…

Information Theory · Computer Science 2019-05-28 Lijing Zheng , Jie Peng , Haibin Kan , Yanjun Li

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

In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering…

Combinatorics · Mathematics 2022-07-13 José Andrés Armario , Ronan Egan , Dane Flannery

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

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

Bent functions can be classified into regular bent functions, weakly regular but not regular bent functions, and non-weakly regular bent functions. Regular and weakly regular bent functions always appear in pairs since their duals are also…

Information Theory · Computer Science 2015-11-10 Ayca Cesmelioglu , Wilfried Meidl , Alexander Pott

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

Four families of generalizations of trigonometric functions were recently introduced. In the paper the functions are transformed into four families of orthogonal polynomials depending on two variables. Recurrence relations for construction…

Mathematical Physics · Physics 2015-03-17 Lenka Motlochova , Jiri Patera

In this paper, we first present a new secondary construction of bent functions (building new bent functions from two already defined ones). Furthermore, we apply the construction using as initial functions some specific bent functions and…

Cryptography and Security · Computer Science 2012-11-20 Fengrong Zhang , Claude Carlet , Yupu Hu , Wenzheng Zhang

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

Combinatorics · Mathematics 2025-10-06 Michael Kiermaier , Jonathan Mannaert , Alfred Wassermann
‹ Prev 1 2 3 10 Next ›