English
Related papers

Related papers: Several classes of bent functions over finite fiel…

200 papers

We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…

Numerical Analysis · Mathematics 2016-12-02 Jean-Paul Gauthier , Dario Prandi

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

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

In this paper we generalize the partial spread class and completely describe it for generalized Boolean functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$. Explicitly, we describe gbent functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$, which can be…

Information Theory · Computer Science 2015-11-06 Thor Martinsen , Wilfried Meidl , Pantelimon Stanica

A one to one correspondence between regular generalized bent functions from $\F_2^n$ to $\Z_{2^m},$ and $m-$tuples of Boolean bent functions is established. This correspondence maps self-dual (resp. anti-self-dual) generalized bent…

Information Theory · Computer Science 2016-11-22 Lin Sok , MinJia Shi , Patrick Solé

In this letter, we give a characterization for a generic construction of bent functions. This characterization enables us to obtain another efficient construction of bent functions and to give a positive answer on a problem of bent…

Information Theory · Computer Science 2024-03-12 Yanjun Li , Jinjie Gao , Haibin Kan , Jie Peng , Lijing Zheng , Changhui Chen

We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions, i.e., multivariate functions over the ring of integers modulo $d$, and investigate some of their structural properties. We also point out…

Vectorial dual-bent functions have recently attracted some researchers' interest as they play a significant role in constructing partial difference sets, association schemes, bent partitions and linear codes. In this paper, we further study…

Information Theory · Computer Science 2023-09-26 Jiaxin Wang , Fang-Wei Fu , Yadi Wei , Jing Yang

The Fox $H$-function is a special function which is defined via the Mellin-Barnes integrals and produces, as particular cases, Wright generalized hypergeometric functions, MacRobert's $E$-functions and Meijer $G$-functions, to name but few.…

Complex Variables · Mathematics 2025-02-18 Filippo Giraldi

Negabent functions were introduced as a generalization of bent functions, which have applications in coding theory and cryptography. In this paper, we have extended the notion of negabent functions to the functions defined from…

Discrete Mathematics · Computer Science 2022-07-25 Deep Singh , Maheshanand Bhaintwal

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…

Number Theory · Mathematics 2023-03-03 Leonardo F. Bielinski , Giuliano G. La Guardia , Jocemar Q. Chagas

Let $Q(x)$ be a quadratic form over $\mathbb{R}^n$. The Epstein zeta function associated to $Q(x)$ is a well known function in number theory. We generalize the construction of the Epstein zeta function to a class of function $\phi(x)$…

Complex Variables · Mathematics 2008-12-16 Sergio Venturini

Let $n$ be an odd positive integer, $p$ be a prime with $p\equiv3\pmod4$, $d_{1} = {{p^{n}-1}\over {2}} -1 $ and $d_{2} =p^{n}-2$. The function defined by $f_u(x)=ux^{d_{1}}+x^{d_{2}}$ is called the generalized Ness-Helleseth function over…

Cryptography and Security · Computer Science 2024-09-02 Yongbo Xia , Chunlei Li , Furong Bao , Shaoping Chen , Tor Helleseth

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

Motivated by the constructions of pseudorandom sequences over the cyclic elliptic function fields by Hu \textit{et al.} in \text{[IEEE Trans. Inf. Theory, 53(7), 2007]} and the constructions of low-correlation, large linear span binary…

Information Theory · Computer Science 2026-02-09 Xiaofeng Liu , Jun Zhang , Fang-Wei Fu

In this contribution we generalize the classical Fourier Mellin transform [S. Dorrode and F. Ghorbel, Robust and efficient Fourier-Mellin transform approximations for gray-level image reconstruction and complete invariant description,…

Rings and Algebras · Mathematics 2013-06-10 Eckhard Hitzer

We introduce a method based on Bezout's theorem on intersection points of two projective plane curves, for determining the nonlinearity of some classes of quadratic functions on $\mathbb{F}_{2^{2m}}$. Among those are the functions of…

Number Theory · Mathematics 2019-04-30 Nurdagül Anbar , Tekgül Kalaycı , Wilfried Meidl

We prove that P != NP by proving the existence of a class of functions we call Tau, each of whose members satisfies the conditions of one-way functions. Each member of Tau is a function computable in polynomial time, with negligible…

Computational Complexity · Computer Science 2016-10-18 Javier A. Arroyo-Figueroa

It is a common knowledge that the integer functions definable in simply typed lambda-calculus are exactly the extended polynomials. This is indeed the case when one interprets integers over the type (p->p)->p->p where p is a base type…

Logic in Computer Science · Computer Science 2007-05-23 Mateusz Zakrzewski
‹ Prev 1 3 4 5 6 7 10 Next ›