English
Related papers

Related papers: A general framework for secondary constructions of…

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

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

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

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

Plateaued functions as an extension of bent functions play a significant role in cryptography, coding theory, sequences and combinatorics. In \cite{Mesnager9}, Mesnager \emph{et al.} introduced generalized plateaued functions in order to…

Information Theory · Computer Science 2022-03-31 Jiaxin Wang , Fang-Wei Fu

Let $n$ be an even positive integer, and $m<n$ be one of its positive divisors. In this paper, inspired by a nice work of Tang et al. on constructing large classes of bent functions from known bent functions [27, IEEE TIT, 63(10):…

Information Theory · Computer Science 2019-05-28 Lijing Zheng , Jie Peng , Haibin Kan , Yanjun Li

We study a secondary construction of Boolean functions, which generalizes the direct sum and the indirect sum. We detail how these two classic secondary constructions are particular cases of this more general one, as well as two known…

Information Theory · Computer Science 2025-05-20 Claude Carlet , Deng Tang

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

Information Theory · Computer Science 2007-07-13 Constanza Riera , Matthew G. Parker

In \cite{Bapic, Tang, Zheng} a new method for the secondary construction of vectorial/Boolean bent functions via the so-called $(P_U)$ property was introduced. In 2018, Qi et al. generalized the methods in \cite{Tang} for the construction…

Information Theory · Computer Science 2022-11-22 Amar Bapić

We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear…

Combinatorics · Mathematics 2008-04-18 Sergey Agievich

Generalized bent (gbent) functions from an $n$-variable Boolean space to $\mathbb{Z}_{2^k}$ are central in cryptography and sequence design. Instead of the usual binary decomposition, we introduce a $2^\ell$-adic representation, for $k=\ell…

Number Theory · Mathematics 2026-04-03 Ayça Çeşmelioğlu , Constanza Riera , Pantelimon Stănică

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

In the first part of this paper [16], some results on how to compute the flat spectra of Boolean constructions w.r.t. the transforms {I,H}^n, {H,N}^n and {I,H,N}^n were presented, and the relevance of Local Complementation to the quadratic…

Information Theory · Computer Science 2007-07-13 Constanza Riera , George Petrides , Matthew G. Parker

Generalized bent (gbent) functions is a class of functions $f: \mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is a positive integer, that generalizes a concept of classical bent functions through their co-domain extension. A lot…

Information Theory · Computer Science 2016-11-22 S. Hodžić , E. Pasalic

The necessary and sufficient conditions for a class of functions $f:\mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is an even positive integer, have been recently identified for $q=4$ and $q=8$. In this article we give an…

Combinatorics · Mathematics 2016-02-01 S. Hodžić , E. Pasalic

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

Rings and Algebras · Mathematics 2011-02-23 Tamás Waldhauser

The design of plateaued functions over $GF(2)^n$, also known as 3-valued Walsh spectra functions (taking the values from the set $\{0, \pm 2^{\lceil \frac{n+s}{2} \rceil}\}$), has been commonly approached by specifying a suitable algebraic…

Information Theory · Computer Science 2018-11-13 S. Hodžić , E. Pasalic , Y. Wei , F. Zhang

In this article a procedure to construct bent functions from $\F_{p^n}$ to $\F_p$ by merging plateaued functions which are bent on ($n-2$)-dimensional subspaces of $\F_{p^n}$ is presented. Taking advantage of such classes of plateaued…

Number Theory · Mathematics 2013-10-31 Ayça Çeşmelioğlu , Wilfried Meidl

Bent functions can be classified into regular bent functions, weakly regular but not regular bent functions, and non-weakly regular bent functions. Regular and weakly regular bent functions always appear in pairs since their duals are also…

Information Theory · Computer Science 2015-11-10 Ayca Cesmelioglu , Wilfried Meidl , Alexander Pott

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

Computational Complexity · Computer Science 2025-04-01 Stepan Margaryan
‹ Prev 1 2 3 10 Next ›