Results 101 to 110 of about 2,028,418 (131)
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks [PDF]
Lecture Notes in Computer Science, 2006 In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in $\mathcal{O}(D^2)$ operations, for $D ...
Philippe Gaborit +2 more
exaly +4 more sources
Improving Fast Algebraic Attacks [PDF]
Lecture Notes in Computer Science, 2004 An algebraic attack is a method for cryptanalysis which is based on finding and solving a system of nonlinear equations. Recently, algebraic attacks where found helpful in cryptanalysing LFSR-based stream ciphers. The efficiency of these attacks greatly depends on the degree of the nonlinear equations.
Frederik Armknecht
exaly +4 more sources
On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongdai Lin, Meicheng Liu
exaly +4 more sources
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback [PDF]
Lecture Notes in Computer Science, 2003 A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attacks, that can be seen as solving a system of multivariate linear equations, true with some probability.
Nicolas Courtois
exaly +2 more sources
More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks [PDF]
IEEE Transactions on Information Theory, 2011 In this paper, three constructions of balanced Boolean functions with optimal algebraic immunity are proposed. It is checked that, at least for small numbers of input variables, these functions have good behavior against fast algebraic attacks as well. Other cryptographic properties such as algebraic degree and nonlinearity of the constructed functions
Claude Carlet +2 more
exaly +3 more sources
On the fast algebraic immunity of threshold functions [PDF]
Cryptography and Communications, 2021 Motivated by the impact of fast algebraic attacks on stream ciphers, and recent constructions using a threshold function as main part of the filtering function, we study the fast algebraic immunity of threshold functions.
Pierrick MEAUX
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 ...
Claude Carlet, Xiaohu Tang, Deng TANG
exaly +4 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 ...
Claude Carlet, Xiaohu Tang, Deng TANG
exaly +4 more sources
Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
Information Sciences, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongdai Lin, Meicheng Liu
exaly +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
exaly +3 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
exaly +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
exaly +4 more sources