Results 151 to 160 of about 650 (169)
Some of the next articles are maybe not open access.
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
On the Resistance of Prime-variable Rotation Symmetric Boolean Functions against Fast Algebraic Attacks. [PDF]
IACR Cryptol. ePrint Arch., 2015 Boolean functions used in stream ciphers should have many cryptographic properties in order to help resist different kinds of cryptanalytic attacks. The resistance of Boolean functions against fast algebraic attacks is an important cryptographic property.
Yusong Du +3 more
openaire +2 more sources
Evolving balanced Boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity. [PDF]
IACR Cryptol. ePrint Arch., 2013 Using simulated annealing, we derive several equivalence classes of balanced Boolean functions with optimum algebraic immunity, fast algebraic resistance, and maximum possible algebraic degree.
James McLaughlin 0003, John A. Clark
openaire +2 more sources
CTC2 and Fast Algebraic Attacks on Block Ciphers Revisited. [PDF]
IACR Cryptol. ePrint Arch., 2007 The cipher CTC (Courtois Toy Cipher) has been designed to demonstrate that it is possible to break on a PC a block cipher with good diffusion and very small number of known (or chosen) plaintexts. It has however never been designed to withstand all known
Nicolas T. Courtois
openaire +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 +1 more source
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
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
Designs, Codes and Cryptography, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiao Li +5 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiao Li +5 more
openaire +2 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 +1 more source
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 +1 more source
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 +1 more source