English
Related papers

Related papers: On the normality of Boolean quartics

200 papers

The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound

Information Theory · Computer Science 2023-03-30 Vladimir N. Potapov

The characterization and construction of bent functions are challenging problems. The paper generalizes the constructions of Boolean bent functions by Mesnager \cite{M2014}, Xu et al. \cite{XCX2015} and $p$-ary bent functions by Xu et al.…

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

We study the nonlinearity of functions defined on a finite field with 2^m elements which are the trace of a polynomial of degree 7 or more general polynomials. We show that for m odd such functions have rather good nonlinearity properties.…

Number Theory · Mathematics 2007-05-23 Eric Férard , François Rodier

In this paper, we investigate properties of functions from $\mathbb{Z}_{p}^n$ to $\mathbb{Z}_q$, where $p$ is an odd prime and $q$ is a positive integer divided by $p$. we present the sufficient and necessary conditions for bent-ness of…

Number Theory · Mathematics 2016-05-10 Libo Wang , Baofeng Wu , Zhuojun Liu

We deal with a notion of weak binormal and weak principal normal for non-smooth curves of the Euclidean space with finite total curvature and total absolute torsion. By means of piecewise linear methods, we first introduce the analogous…

Differential Geometry · Mathematics 2020-05-19 Domenico Mucci , Alberto Saracco

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

In this work, we study functions that can be obtained by restricting a vectorial Boolean function $F \colon \mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$ to an affine hyperplane of dimension $n-1$ and then projecting the output to an…

Information Theory · Computer Science 2022-03-29 Christof Beierle , Gregor Leander , Léo Perrin

Discrete wavelet-based methods promise to emerge as an excellent framework for the non-perturbative analysis of quantum field theories. In this work, we investigate aspects of renormalization in theories analyzed using wavelet-based…

High Energy Physics - Theory · Physics 2023-02-21 Mrinmoy Basak , Raghunath Ratabole

In this article a technique for constructing $p$-ary bent functions from near-bent functions is presented. Two classes of quadratic $p$-ary functions are shown to be near-bent. Applying the construction of bent functions to these classes of…

Combinatorics · Mathematics 2010-11-30 Ayca Cesmelioglu , Gary McGuire , Wilfried Meidl

We give a geometric characterization of vectorial boolean functions with differential uniformity less or equal to 4.

Algebraic Geometry · Mathematics 2009-07-13 Yves Aubry , François Rodier

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 paper, we further investigate properties of generalized bent Boolean functions from $\Z_{p}^n$ to $\Z_{p^k}$, where $p$ is an odd prime and $k$ is a positive integer. For various kinds of representations, sufficient and necessary…

Number Theory · Mathematics 2016-06-09 Libo Wang , Baofeng Wu , Zhuojun Liu

This paper studies the mathematical properties of collectively canalizing Boolean functions, a class of functions that has arisen from applications in systems biology. Boolean networks are an increasingly popular modeling framework for…

Discrete Mathematics · Computer Science 2023-06-07 Claus Kadelka , Benjamin Keilty , Reinhard Laubenbacher

Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theory in the domain of Boolean functions with low polynomial…

Computational Complexity · Computer Science 2021-07-26 Subhamoy Maitra , Chandra Sekhar Mukherjee , Pantelimon Stanica , Deng Tang

A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…

Probability · Mathematics 2012-06-21 Itai Benjamini , Oded Schramm , David B. Wilson

Much work has been devoted to bent functions in odd characteristic, but there still remains a gap between our knowledge of binary and nonbinary bent functions. In the first part of this paper, we attempt to partially bridge this gap by…

Discrete Mathematics · Computer Science 2026-04-20 Claude Carlet , and Alexander Kholosha

The study of Boolean functions with low $c$-differential uniformity has become recently an important topic of research. However, in odd characteristic case, there are not many results on the ($c$-)differential uniformity of functions that…

Information Theory · Computer Science 2024-10-17 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

In this paper we prove that in opposite to the cases of 6 and 8 variables, the Maiorana-McFarland construction does not describe the whole class of cubic bent functions in $n$ variables for all $n\ge 10$. Moreover, we show that for almost…

Combinatorics · Mathematics 2020-04-03 Alexandr Polujan , Alexander Pott

Boolean functions with strong cryptographic properties, such as high nonlinearity and algebraic degree, are important for the security of stream and block ciphers. These functions can be designed using algebraic constructions or…

Neural and Evolutionary Computing · Computer Science 2025-11-18 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek , Alexandr Polujan

Bent-negabent functions have many important properties for their application in cryptography since they have the flat absolute spectrum under the both Walsh-Hadamard transform and nega-Hadamard transform. In this paper, we present four new…

Information Theory · Computer Science 2022-09-20 Fei Guo , Zilong Wang , Guang Gong