Results 121 to 130 of about 17,540 (147)
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.
Li, Jiao +5 more
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Jiao +5 more
openaire +4 more sources
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
openaire +4 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
openaire +4 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
openaire +3 more sources
International Journal of Foundations of Computer Science, 2014
Recently, Tang, Carlet and Tang presented a combinatorial conjecture about binary strings, allowing proving that all balanced functions in some infinite class they introduced have optimal algebraic immunity. Later, Cohen and Flori completely proved that the conjecture is true.
Tang, Deng, Carlet, Claude, Tang, Xiaohu
openaire +2 more sources
Recently, Tang, Carlet and Tang presented a combinatorial conjecture about binary strings, allowing proving that all balanced functions in some infinite class they introduced have optimal algebraic immunity. Later, Cohen and Flori completely proved that the conjecture is true.
Tang, Deng, Carlet, Claude, Tang, Xiaohu
openaire +2 more sources
Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
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 +1 more source
Establishing Equations: The Complexity of Algebraic and Fast Algebraic Attacks Revisited
2015Algebraic and fast algebraic attacks have posed serious threats to some deployed LFSR-based stream ciphers. Previous works on this topic focused on reducing the time complexity by lowering the degree of the equations, speeding up the substitution step by Fast Fourier Transform and analysis of Boolean functions exhibiting the optimal algebraic immunity.
Lin Jiao, Bin Zhang, Mingsheng Wang
openaire +1 more source
On the Resistance of Boolean Functions against Fast Algebraic Attacks
2012Boolean functions with large algebraic immunity resist algebraic attacks to a certain degree, but they may not resist fast algebraic attacks (FAA's). It is necessary to study the resistance of Boolean functions against FAA's. In this paper, we localize the optimal resistance of Boolean functions against FAA's and introduce the concept of e-fast ...
Yusong Du, Fangguo Zhang, Meicheng Liu
openaire +1 more source
A Note on Fast Algebraic Attacks and Higher Order Nonlinearities
2011In this note, we deduce a bound between fast algebraic immunity and higher order nonlinearity (it is the first time that a bound between these two cryptographic criteria is given), and find that a Boolean function should have high r-order nonlinearity to resist fast algebraic attacks.
Qichun Wang, Thomas Johansson
openaire +1 more source
Introducing a New Variant of Fast Algebraic Attacks and Minimizing Their Successive Data Complexity
2005Algebraic attacks have established themselves as a powerful method for the cryptanalysis of LFSR-based keystream generators (e.g., E0 used in Bluetooth). The attack is based on solving an overdetermined system of low-degree equations Rt=0, where Rtis an expression in the state of the LFSRs at clock t and one or several successive keystream bits zt ...
Armknecht, Frederik, Ars, Gwénolé
openaire +3 more sources
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