English
Related papers

Related papers: (Not) weakly regular univariate bent functions

200 papers

In this paper we introduce generalized hyperbent functions from $F_{2^n}$ to $Z_{2^k}$, and investigate decompositions of generalized (hyper)bent functions. We show that generalized (hyper)bent functions from $F_{2^n}$ to $Z_{2^k}$ consist…

Information Theory · Computer Science 2016-04-12 Thor Martinsen , Wilfried Meidl , Sihem Mesnager , Pantelimon Stanica

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

In the literature, few constructions of $n$-variable rotation symmetric bent functions have been presented, which either have restriction on $n$ or have algebraic degree no more than $4$. In this paper, for any even integer $n=2m\ge2$, a…

Information Theory · Computer Science 2015-05-13 Sihong Su , Xiaohu Tang

The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound

Information Theory · Computer Science 2024-11-19 Vladimir N. Potapov

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 present an explicit construction for feedforward neural network (FNN), which provides a piecewise constant approximation for multivariate functions. The proposed FNN has two hidden layers, where the weights and thresholds are explicitly…

Numerical Analysis · Mathematics 2018-08-23 Kailiang Wu , Dongbin Xiu

We generalize the construction of affine polar graphs in two different ways to obtain new partial difference sets and amorphic association schemes. The first generalization uses a combination of quadratic forms and uniform cyclotomy. In the…

Combinatorics · Mathematics 2011-08-02 Tao Feng , Bin Wen , Qing Xiang , Jianxing Yin

We present the application of variational-wavelet analysis to numerical/analytical calculations of Wigner functions in (nonlinear) quasiclassical beam dynamics problems. (Naive) deformation quantization and multiresolution representations…

Accelerator Physics · Physics 2007-05-23 Antonina N. Fedorova , Michael G. Zeitlin

In this paper, we introduce a new class of subsets of bounded linear operators between Banach spaces which is p-version of the uniformly completely continuous sets. Then, we study the relationship between these sets with the equicompact…

Functional Analysis · Mathematics 2020-03-26 M. Alikhani

In the literature, few $n$-variable rotation symmetric bent functions have been constructed. In this paper, we present two infinite classes of rotation symmetric bent functions on $\mathbb{F}_2^{n}$ of the two forms: {\rm (i)}…

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

The set of linear structures of most known balanced Boolean functions is nontrivial. In this paper, some balanced Boolean functions whose set of linear structures is trivial are constructed. We show that any APN function in even dimension…

Cryptography and Security · Computer Science 2019-09-26 Augustine Musukwa , Massimiliano Sala

A general method to construct basis functions for fermionic systems which account for the $SU(2)$ symmetry and for the translational invariance of the Hamiltonian is presented. The method does not depend on the dimensionality of the system…

chao-dyn · Physics 2008-02-03 Mario Salerno

We present the Fast Newton Transform (FNT), an algorithm for performing $m$-variate Newton interpolation in downward closed polynomial spaces with time complexity $\mathcal{O}(|A|m\overline{n})$. Here, $A$ is a downward closed set of…

Numerical Analysis · Mathematics 2025-12-25 Phil-Alexander Hofmann , Michael Hecht

In this paper, we investigate the problem of finding tight linear lower bounding functions for multivariate polynomials over boxes. These functions are obtained by the expansion of polynomials into Bernstein form and using the linear least…

Optimization and Control · Mathematics 2019-12-17 Tareq Hamadneh , Hassan Al-Zoubi , Mohammad Al-Qudah , Amjed Zraiqat

By universal formulas we understand parameterized analytic expressions that have a fixed complexity, but nevertheless can approximate any continuous function on a compact set. There exist various examples of such formulas, including some in…

Machine Learning · Computer Science 2023-11-08 Dmitry Yarotsky

We obtain an explicit criterion for $p$-ary functions to produce association schemes in terms of their Walsh spectrum. Employing this characterization, we explicitly find a correlation between $p$-ary bent functions and association schemes;…

Information Theory · Computer Science 2021-12-14 Yansheng Wu , Jong Yoon Hyun , Yoonjin Lee

Bent functions of the form $\mathbb{F}_2^n\rightarrow\mathbb{Z}_q$, where $q\geqslant2$ is a positive integer, are known as generalized bent (gbent) functions. Gbent functions for which it is possible to define a dual gbent function are…

Combinatorics · Mathematics 2021-07-29 Aleksandr Kutsenko

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 article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…

Combinatorics · Mathematics 2025-01-08 Hiroaki Taniguchi , Alexandr Polujan , Alexander Pott , Razi Arshad

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