English
Related papers

Related papers: On design-theoretic aspects of Boolean and vectori…

200 papers

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

Valuations, as additive functionals, allow various applications in Stochastic Geometry, yielding mean value formulas for specific random closed sets and processes of convex or polyconvex particles. In particular, valuations are especially…

Probability · Mathematics 2015-10-28 Julia Hörrmann , Wolfgang Weil

In continuation of Part I, we study translative integral formulas for certain translation invariant functionals, which are defined on general convex bodies. Again, we consider local extensions and use these to show that the translative…

Metric Geometry · Mathematics 2016-08-19 Wolfgang Weil

In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number…

Information Theory · Computer Science 2009-11-18 WeiGuo Zhang , GuoZhen Xiao

We show that the problem of counting the number of $n$-variable unate functions reduces to the problem of counting the number of $n$-variable monotone functions. Using recently obtained results on $n$-variable monotone functions, we obtain…

Combinatorics · Mathematics 2023-10-04 Aniruddha Biswas , Palash Sarkar

In this paper, we investigate permutation rotation-symmetric (shift-invariant) vectorial Boolean functions on $n$ bits that are liftings from Boolean functions on $k$ bits, for $k\leq n$. These functions generalize the well-known map used…

Combinatorics · Mathematics 2022-08-22 Tron Omland , Pantelimon Stanica

A relative t-design in the binary Hamming association schemes H(n,2) is equivalent to a weighted regular t-wise balanced design, i.e., certain combinatorial t-design which allow different sizes of blocks and a weight function on blocks. In…

Combinatorics · Mathematics 2015-12-08 Eiichi Bannai , Etsuko Bannai , Yan Zhu

Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.…

Computational Complexity · Computer Science 2010-08-11 Janusz Brzozowski , Baiyu Li , Yuli Ye

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

Affine equivalent classes of Boolean functions have many applications in modern cryptography and circuit design. Previous publications have shown that affine equivalence on the entire space of Boolean functions can be computed up to 10…

Information Theory · Computer Science 2020-08-11 Xiao Zeng , Guowu Yang

In this paper, we study the dual of generalized bent functions $f: V_{n}\rightarrow \mathbb{Z}_{p^k}$ where $V_{n}$ is an $n$-dimensional vector space over $\mathbb{F}_{p}$ and $p$ is an odd prime, $k$ is a positive integer. It is known…

Information Theory · Computer Science 2021-06-08 Jiaxin Wang , Fang-Wei Fu

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 good cryptographic properties like high nonlinearity and algebraic degree play an important in the security of stream and block ciphers. Such functions may be designed, for instance, by algebraic constructions or…

Neural and Evolutionary Computing · Computer Science 2025-01-31 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

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

Whereas the design and properties of bent and plateaued functions have been frequently addressed during the past few decades, there are only a few design methods of so-called 5-valued spectra Boolean functions whose Walsh spectra takes the…

Information Theory · Computer Science 2018-11-29 S. Hodžić , E. Pasalic , W. G. Zhang

Binary code similarity detection is a core task in reverse engineering. It supports malware analysis and vulnerability discovery by identifying semantically similar code in different contexts. Modern methods have progressed from manually…

Artificial Intelligence · Computer Science 2025-09-30 Charles E. Gagnon , Steven H. H. Ding , Philippe Charland , Benjamin C. M. Fung

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

It is known that partial spreads is a class of bent partitions. In \cite{AM2022Be,MP2021Be}, two classes of bent partitions whose forms are similar to partial spreads were presented. In \cite{AKM2022Ge}, more bent partitions $\Gamma_{1},…

Information Theory · Computer Science 2023-01-03 Jiaxin Wang , Fang-Wei Fu , Yadi Wei

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Discrete Mathematics · Computer Science 2020-07-07 Erhan Oztop , Minoru Asada

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