English
Related papers

Related papers: Symmetric Boolean Function with Maximum Algebraic …

200 papers

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

From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of {\em algebraic immunity} (AI) was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary…

Cryptography and Security · Computer Science 2007-05-23 Hao Chen , Jianhua Li

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

Algebraic and fast algebraic attacks are power tools to analyze stream ciphers. A class of symmetric Boolean functions with maximum algebraic immunity were found vulnerable to fast algebraic attacks at EUROCRYPT'06. Recently, the notion of…

Cryptography and Security · Computer Science 2016-11-15 Meicheng Liu , Dongdai Lin

Nowadays, the resistance against algebraic attacks and fast algebraic attacks are considered as an important cryptographic property for Boolean functions used in stream ciphers. Both attacks are very powerful analysis concepts and can be…

Information Theory · Computer Science 2020-06-16 Sihem Mesnager , Chunming Tang

We describe a new class of Boolean functions which provide the presently best known trade-off between low computational complexity, nonlinearity and (fast) algebraic immunity. In particular, for $n\leq 20$, we show that there are functions…

Cryptography and Security · Computer Science 2025-01-14 Claude Carlet , Palash Sarkar

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

Constructing $2m$-variable Boolean functions with optimal algebraic immunity based on decomposition of additive group of the finite field $\mathbb{F}_{2^{2m}}$ seems to be a promising approach since Tu and Deng's work. In this paper, we…

Cryptography and Security · Computer Science 2013-04-11 Jia Zheng , Baofeng Wu , Yufu Chen , Zhuojun Liu

In this correspondence, an equivalent definition of algebraic immunity of Boolean functions is posed, which can clear up the confusion caused by the proof of optimal algebraic immunity of the Carlet-Feng function and some other functions…

Cryptography and Security · Computer Science 2013-05-28 Baofeng Wu , Jia Zheng

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

We propose a general approach to construct cryptographic significant Boolean functions of $(r+1)m$ variables based on the additive decomposition $\mathbb{F}_{2^{rm}}\times\mathbb{F}_{2^m}$ of the finite field $\mathbb{F}_{2^{(r+1)m}}$,…

Cryptography and Security · Computer Science 2014-01-28 Baofeng Wu , Qingfang Jin , Zhuojun Liu , Dongdai Lin

In this note, we go further on the "basis exchange" idea presented in \cite{LiNa1} by using Mobious inversion. We show that the matrix $S_1(f)S_0(f)^{-1}$ has a nice form when $f$ is chosen to be the majority function, where $S_1(f)$ is the…

Cryptography and Security · Computer Science 2015-05-30 Yuan Li , Haibin Kan , Futatsugi Kokichi

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

Boolean functions with high algebraic immunity are important cryptographic primitives in some stream ciphers. In this paper, two methodologies for constructing binary minimal codes from sets, Boolean functions and vectorial Boolean…

Information Theory · Computer Science 2020-04-13 Hang Chen , Cunsheng Ding , Sihem Mesnager , Chunming Tang

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 study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…

Data Structures and Algorithms · Computer Science 2014-02-11 Ferdinando Cicalese , Travis Gagie , Eduardo Laber , Martin Milanic

We discuss the second-order differential uniformity of vectorial Boolean functions. The closely related notion of second-order zero differential uniformity has recently been studied in connection to resistance to the boomerang attack. We…

Information Theory · Computer Science 2024-10-02 Connor O'Reilly , Ana Sălăgean

A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…

Classical Analysis and ODEs · Mathematics 2023-02-02 Shaul Zemel

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…

‹ Prev 1 2 3 10 Next ›