English
Related papers

Related papers: Several Classes of Negabent Functions over Finite …

200 papers

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

Constructing permutation polynomials over finite fields, particularly those with simple algebraic structure in multiple variables, is a fundamental problem with applications in cryptography and coding theory. Recently, Li and Kaleyski (IEEE…

Number Theory · Mathematics 2026-02-24 Daniele Bartoli , Mohit Pal , Pantelimon Stanica , Tommaso Toccotelli

In 2017, Zhang et al. proposed a question (not open problem) and two open problems in [IEEE TIT 63 (8): 5336--5349, 2017] about constructing bent functions by using Rothaus' construction. In this note, we prove that the sufficient…

Information Theory · Computer Science 2025-02-17 Fei Guo , Zilong Wang , Guang Gong

An implicit operation of a class of similar algebras $\mathsf{K}$ is a collection of first order definable partial functions on the members of $\mathsf{K}$ that is globally preserved by homomorphisms. For instance, "taking inverses" can be…

Rings and Algebras · Mathematics 2026-03-17 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over $\mathbb{F}_{2^n}$ which have explicit forms by determining…

Information Theory · Computer Science 2017-06-02 Yanping Wang , WeiGuo Zhang , Zhengbang Zha

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

The study of iterations of functions over a finite field and the corresponding functional graphs is a growing area of research with connections to cryptography. The behaviour of such iterations is frequently approximated by what is know as…

Discrete Mathematics · Computer Science 2016-04-08 Rodrigo S. V. Martins , Daniel Panario

We prove the existence of secondary terms of order X^{5/6} in the Davenport-Heilbronn theorems on cubic fields and 3-torsion in class groups of quadratic fields. For cubic fields this confirms a conjecture of Datskovsky-Wright and Roberts.…

Number Theory · Mathematics 2019-12-19 Takashi Taniguchi , Frank Thorne

We describe the two sets of meromorphic univalent functions in the class $\Sigma$, for which the sequence of Faber polynomials $\{F_j\}_{j=1}^\infty $ have the roots with following properties respectively:…

Complex Variables · Mathematics 2015-05-12 Viktor Savchuk

We propose a general approach to construct cryptographic significant Boolean functions of $(r+1)m$ variables based on the additive decomposition $\mathbb{F}_{2^{rm}}\times\mathbb{F}_{2^m}$ of the finite field $\mathbb{F}_{2^{(r+1)m}}$,…

Cryptography and Security · Computer Science 2014-01-28 Baofeng Wu , Qingfang Jin , Zhuojun Liu , Dongdai Lin

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

The study of finite projective planes involves planar functions, namely, functions f : F_q --> F_q such that, for each nonzero a in F_q, the function c --> f(c+a) - f(c) is a bijection on F_q. Planar functions are also used in the…

Combinatorics · Mathematics 2016-03-04 Michael Zieve

Let $n=2m$. In the present paper, we study the binomial Boolean functions of the form $$f_{a,b}(x) = \mathrm{Tr}_1^{n}(a x^{2^m-1 }) +\mathrm{Tr}_1^{2}(bx^{\frac{2^n-1}{3} }), $$ where $m$ is an even positive integer, $a\in…

Information Theory · Computer Science 2021-09-29 Chunming Tang , Peng Han , Qi Wang , Jun Zhang , Yanfeng Qi

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

Combinatorics · Mathematics 2014-03-04 Zipei Nie , Anthony Y. Wang

We know that for a finite field $F$, every function on $F$ can be given by a polynomial with coefficients in $F$. What about the converse? i.e. if $R$ is a ring (not necessarily commutative or with unity) such that every function on $R$ can…

Commutative Algebra · Mathematics 2017-12-13 Souvik Dey

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…

Information Theory · Computer Science 2016-12-13 Nastja Cepak , Pascale Charpin , Enes Pasalic

We study the counting function of cubic function fields. Specifically, we derive an asymptotic formula for this counting function including a secondary term and an error term of order $\mathcal{O}\big(X^{2/3+\epsilon}\big)$, which matches…

Number Theory · Mathematics 2025-06-25 Victor Ahlquist

Every Boolean bent function $f$ can be written either as a concatenation $f=f_1||f_2$ of two complementary semi-bent functions $f_1,f_2$; or as a concatenation $f=f_1||f_2||f_3||f_4$ of four Boolean functions $f_1,f_2,f_3,f_4$, all of which…

Information Theory · Computer Science 2024-04-26 Sadmir Kudin , Enes Pasalic , Alexandr Polujan , Fengrong Zhang

We give a function field specific, algebraic proof of the main results of class field theory for abelian extensions of degree coprime to the characteristic. By adapting some methods known for number fields and combining them in a new way,…

Number Theory · Mathematics 2015-12-03 Florian Hess , Maike Massierer

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
‹ Prev 1 4 5 6 7 8 10 Next ›