Results 111 to 120 of about 2,028,418 (131)
Some of the next articles are maybe not open access.
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
Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yindong Chen
exaly +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yindong Chen
exaly +4 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 +2 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 ...
Marc P C Fossorier, Miodrag J Mihaljevic
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 ...
Marc P C Fossorier, Miodrag J Mihaljevic
exaly +2 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 +2 more sources
Designs, Codes, and Cryptography, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chunlei Li +2 more
exaly +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chunlei Li +2 more
exaly +4 more sources
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
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
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
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 +2 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 +2 more sources
Sequences, DFT and Resistance against Fast Algebraic Attacks
2008The discrete Fourier transform (DFT) of a boolean function yields a trace representation or equivalently, a polynomial representation, of the boolean function, which is identical to the DFT of the sequence associated with the boolean function. Using this tool, we investigate characterizations of boolean functions for which the fast algebraic attack is ...
openaire +2 more sources