English
Related papers

Related papers: On $(2n/3-1)$-resilient $(n,2)$-functions

200 papers

It is known that the order of correlation immunity of a nonconstant unbalanced Boolean function in $n$ variables cannot exceed $2n/3-1$; moreover, it is $2n/3-1$ if and only if the function corresponds to an equitable $2$-partition of the…

Combinatorics · Mathematics 2023-04-11 Denis S. Krotov , Konstantin V. Vorob'ev

The number of $n$-ary balanced correlation immune (resilient) Boolean functions of order $\frac{n}{2}$ is not less than $n^{2^{(n/2)-2}(1+o(1))}$ as $n\rightarrow\infty$. Keywords: resilient function, correlation immune function, orthogonal…

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

A coloring of the Boolean $n$-cube is called perfect if, for every vertex $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean function is called correlation-immune of degree $n-m$ if it…

Combinatorics · Mathematics 2011-01-20 Vladimir N. Potapov

The $n$-dimensional hypercube has $n+1$ distinct eigenvalues $n-2i$, $0\leq i\leq n$, with corresponding eigenspaces $U_i(n)$. In 2021 it was proved by the author that if a function with non-empty support belongs to the direct sum…

Combinatorics · Mathematics 2023-03-21 Alexandr Valyuzhenich

A coloring of the $q$-ary $n$-dimensional cube (hypercube) is called perfect if, for every $n$-tuple $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean-valued function is called…

Combinatorics · Mathematics 2014-04-16 Vladimir N. Potapov

Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an $n$-variable…

Cryptography and Security · Computer Science 2007-05-23 Na Li , Wen-Feng Qi

We describe several families of efficiently implementable Boolean functions achieving provable trade-offs between resiliency, nonlinearity, and algebraic immunity. In particular, the following statement holds for each of the function…

Cryptography and Security · Computer Science 2026-01-13 Palash Sarkar

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov

Algebraic immunity of Boolean function $f$ is defined as the minimal degree of a nonzero $g$ such that $fg=0$ or $(f+1)g=0$. Given a positive even integer $n$, it is found that the weight distribution of any $n$-variable symmetric Boolean…

Cryptography and Security · Computer Science 2012-02-07 Hui Wang , Jie Peng , Yuan Li , Haibin Kan

In this paper, we explicitly construct a large class of symmetric Boolean functions on $2k$ variables with algebraic immunity not less than $d$, where integer $k$ is given arbitrarily and $d$ is a given suffix of $k$ in binary…

Cryptography and Security · Computer Science 2011-10-19 Yuan Li , Hui Wang , Haibin Kan

A perfect $k$-coloring of the Boolean hypercube $Q_n$ is a function from the set of binary words of length $n$ onto a $k$-set of colors such that for any colors $i$ and $j$ every word of color $i$ has exactly $S(i,j)$ neighbors (at Hamming…

Combinatorics · Mathematics 2024-07-15 Denis S. Krotov , Alexandr A. Valyuzhenich

A boolean function of $n$ boolean variables is {correlation-immune} of order $k$ if the function value is uncorrelated with the values of any $k$ of the arguments. Such functions are of considerable interest due to their cryptographic…

Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root…

Other Computer Science · Computer Science 2013-09-17 Debesh K. Das , Debabani Chowdhury , Bhargab B. Bhattacharya , Tsutomu Sasao

An $n$-bit boolean function is resilient to coalitions of size $q$ if any fixed set of $q$ bits is unlikely to influence the function when the other $n-q$ bits are chosen uniformly. We give explicit constructions of depth-$3$ circuits that…

Computational Complexity · Computer Science 2024-07-01 Peter Ivanov , Emanuele Viola

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

To resist algebraic attack, a Boolean function should possess good algebraic immunity (AI). Several papers constructed symmetric functions with the maximum algebraic immunity $\lceil \frac{n}{2}\rceil $. In this correspondence we prove that…

Cryptography and Security · Computer Science 2007-05-23 Na Li , Wen-feng Qi

For a set $A$ of nonnegative integers, let $R_2(A,n)$ denote the number of solutions to $n=a+a'$ with $a,a'\in A$, $a<a'$. Let $A_0$ be the Thue-Morse sequence and $B_0=\mathbb{N}\setminus A_0$. Let $A\subset \mathbb{N}$ and $N$ be a…

Number Theory · Mathematics 2019-11-06 Xing-Wang Jiang , Csaba Sandor , Quan-Hui Yang

Let $f$ be a multiplicative function which satisfies \[ f(a^2+b^2+c^2+d^2) = f(a^2+b^2)+f(c^2+d^2) \] for positive integers $a$, $b$, $c$, and $d$. We show that $f$ is the identity function provided that $f(3)\,f(11) \ne 0$. Otherwise,…

Number Theory · Mathematics 2019-03-26 Poo-Sung Park

The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its…

Quantum Physics · Physics 2016-11-15 Avraham Ben-Aroya , Oded Regev , Ronald de Wolf

Given any ${\bf{a}}: = \left( {a_1 ,a_2 , \ldots ,a_n } \right)$ and ${\bf{b}}: = \left( {b_1 ,b_2 , \ldots ,b_n } \right)$ in $\mathbb{R}^n$. The $\textbf{n}$-fold convex function defined on $\left[ {{\bf{a}},{\bf{b}}} \right]$,…

Classical Analysis and ODEs · Mathematics 2016-04-08 Mohammad W. Alomari
‹ Prev 1 2 3 10 Next ›