Results 121 to 130 of about 2,067,807 (144)
Some of the next articles are maybe not open access.
Designs, Codes, and Cryptography, 2010
Let \(\{b_1,\dots,b_n\}\) be a basis of \({\mathbb F}_{2^n}\). By identifying every element \(x = \sum_{i=1}^n x_ib_i\) of \({\mathbb F}_{2^n}\) with the \(n\)-tuple of its coordinates \((x_1,\dots,x_n)\), we define a natural correspondence between Boolean functions and polynomials functions from \( {\mathbb F}_{2^n}\) to \( {\mathbb F}_2\).
Panagiotis Rizomiliotis
exaly +5 more sources
Let \(\{b_1,\dots,b_n\}\) be a basis of \({\mathbb F}_{2^n}\). By identifying every element \(x = \sum_{i=1}^n x_ib_i\) of \({\mathbb F}_{2^n}\) with the \(n\)-tuple of its coordinates \((x_1,\dots,x_n)\), we define a natural correspondence between Boolean functions and polynomials functions from \( {\mathbb F}_{2^n}\) to \( {\mathbb F}_2\).
Panagiotis Rizomiliotis
exaly +5 more sources
Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
Lecture Notes in Computer Science, 2006We show in this paper how to apply well known methods from sparse linear algebra to the problem of computing the immunity of a Boolean function against algebraic or fast algebraic attacks. For an n-variable Boolean function, this approach gives an algorithm that works for both attacks in O(n2nD) complexity and O(n2n) memory. Here and d corresponds to
Frédéric Didier
exaly +4 more sources
Designs, Codes, and Cryptography, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chunlei Li +2 more
exaly +5 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chunlei Li +2 more
exaly +5 more sources
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
Qichun Wang, T. Johansson, Haibin Kan
exaly +3 more sources
Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
Information Security Conference, 2014Given a Boolean function with n variables, a revised algorithm for computing the algebraic immunity d against conventional algebraic attacks in O(D 2±e ) complexity is described for \(D=\sum _{i = 0}^d {n \choose i}\) and a small e, which corrects and clarifies the most efficient algorithm so far at Eurocrypt 2006.
Lin Jiao, Bin Zhang, Mingsheng Wang
openaire +3 more sources
On Computing the Immunity of Boolean Power Functions Against Fast Algebraic Attacks
International Conference on Information Security and Cryptology, 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 +3 more sources
A Note on the Optimal Immunity of Boolean Functions Against Fast Algebraic Attacks
International Conference on Mathematics and Computing, 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 +2 more sources
Conference on Information Security and Cryptology, 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 +3 more sources
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 +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
core +3 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. In this regard, given a Boolean function $f$, just checking the minimum degree annihilators of $f, 1+f$ is not enough
Deepak Kumar Dalai +2 more
core +3 more sources