Results 141 to 150 of about 650 (169)
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 +1 more
exaly +3 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 +1 more
exaly +3 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
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, Claude Carlet, Xiaohu Tang
exaly +3 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, Claude Carlet, Xiaohu Tang
exaly +3 more sources
Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yindong Chen
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yindong Chen
exaly +3 more sources
A CLASS OF 1-RESILIENT BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY AND GOOD BEHAVIOR AGAINST FAST ALGEBRAIC ATTACKS [PDF]
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.
Deng Tang +2 more
openaire +3 more sources
Lecture Notes in Computer Science, 2005
This paper proposes a novel approach for cryptanalysis of keystream generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanalysis based on the following: Suppose certain B bits of the LFSM initial state as known and identify ...
Miodrag J Mihaljevic +2 more
exaly +2 more sources
This paper proposes a novel approach for cryptanalysis of keystream generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanalysis based on the following: Suppose certain B bits of the LFSM initial state as known and identify ...
Miodrag J Mihaljevic +2 more
exaly +2 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 +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
On the Existence of Boolean Functions with Optimal Resistance against Fast Algebraic Attacks. [PDF]
IACR Cryptol. ePrint Arch., 2012 It has been pointed out that an $n$-variable Boolean function $f$ has optimal resistance against fast algebraic attacks if and only if there does not exist a nonzero $n$-variable Boolean function $g$ of degree lower than $\frac{n}{2}$ such that $fg=h ...
Yusong Du, Fangguo Zhang
openaire +2 more sources
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