Results 121 to 130 of about 475 (134)
Some of the next articles are maybe not open access.
Designs, Codes, and Cryptography, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Claude Carlet +2 more
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Claude Carlet +2 more
exaly +3 more sources
On the (Fast) Algebraic Immunity of Boolean Power Functions. [PDF]
IACR Cryptol. ePrint Arch., 2015 The (fast) algebraic immunity, including (standard) algebraic immunity and the resistance against fast algebraic attacks, has been considered as an important cryptographic property for Boolean functions used in stream ciphers.
Yusong Du +3 more
openaire +2 more sources
Notion of Algebraic Immunity and Its evaluation Related to Fast Algebraic Attacks. [PDF]
IACR Cryptol. ePrint Arch., 2006 It has been noted recently that algebraic (annihilator) immunity alone does not provide sufficient resistance against algebraic attacks.
Deepak Kumar Dalai +2 more
openaire +2 more sources
Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
IEEE Transactions on Information Theory, 2011 In this correspondence, first we give a decomposition of symmetric Boolean functions, then we show that almost all symmetric Boolean functions, including these functions with good algebraic immunity, behave badly against fast algebraic attacks.
Meicheng Liu, Dongdai Lin
exaly +1 more source
Some results on fast algebraic attacks and higher-order non-linearities
IET Information Security, 2012 In this study, the authors investigate the resistance of Boolean functions against fast algebraic attacks and deduce a bound between fast algebraic immunity and higher-order non-linearity (it is the first time that a bound between these two cryptographic
Wang, Q., Johansson, Thomas, Kan, H.
exaly +2 more sources
Fast Algebraic Immunity of 2m+2 & 2m+3 variables Majority Function. [PDF]
IACR Cryptol. ePrint Arch., 2019 Boolean functions used in some cryptosystems of stream ciphers should satisfy various criteria simultaneously to resist some known attacks. The fast algebraic attack (FAA) is feasible if one can find a nonzero function $g$ of low algebraic degree and a ...
Yindong Chen, Fei Guo, Liu Zhang
openaire +2 more sources
IEEE Transactions on Information Theory, 2013
Inspired by the previous work of Tu and Deng, we propose two infinite classes of Boolean functions of 2k variables where k ≥ 2. The first class contains unbalanced functions having high algebraic degree and nonlinearity. The functions in the second one are balanced and have maximal algebraic degree and high nonlinearity (as shown by a lower bound that ...
Deng Tang +2 more
openaire +2 more sources
Inspired by the previous work of Tu and Deng, we propose two infinite classes of Boolean functions of 2k variables where k ≥ 2. The first class contains unbalanced functions having high algebraic degree and nonlinearity. The functions in the second one are balanced and have maximal algebraic degree and high nonlinearity (as shown by a lower bound that ...
Deng Tang +2 more
openaire +2 more sources
2013
In this paper, we study a class of Boolean functions with good cryptographic properties. We show that the functions of this class are 1-resilient and have optimal algebraic degree and good nonlinearity. Further, we prove that the functions of this class have at least sub-maximum algebraic immunity.
Tianze Wang, Meicheng Liu, Dongdai Lin
openaire +1 more source
In this paper, we study a class of Boolean functions with good cryptographic properties. We show that the functions of this class are 1-resilient and have optimal algebraic degree and good nonlinearity. Further, we prove that the functions of this class have at least sub-maximum algebraic immunity.
Tianze Wang, Meicheng Liu, Dongdai Lin
openaire +1 more source
On Computing the Immunity of Boolean Power Functions Against Fast Algebraic Attacks
2017The immunity of Boolean functions against fast algebraic attacks FAA's has been considered as an important cryptographic property for Boolean functions used in stream ciphers. An n-variable Boolean power function f can be represented as a monomial trace function over finite field $$\mathbb {F}_{2^n}$$, $$fx=Tr_1^n\lambda x^k$$, where $$\lambda \in ...
Yusong Du, Baodian Wei
openaire +1 more source
A Note on the Optimal Immunity of Boolean Functions Against Fast Algebraic Attacks
2017The immunity of Boolean functions against fast algebraic attacks is an important cryptographic property. When deciding the optimal immunity of an n-variable Boolean function against fast algebraic attacks, one may need to compute the ranks of a series of matrices of size \(\sum _{i=d+1}^{n}{n \atopwithdelims ()i}\times \sum _{i=0}^e{n \atopwithdelims ()
Jing Shen, Yusong Du
openaire +1 more source