Results 131 to 140 of about 17,540 (147)

Sequences, DFT and Resistance against Fast Algebraic Attacks

2008
The 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

Construction of Resilient and Nonlinear Boolean Functions with Almost Perfect Immunity to Algebraic and Fast Algebraic Attacks

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

Cryptanalysis of Keystream Generator by Decimated Sample Based Algebraic and Fast Correlation Attacks

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. Mihaljević, Marc P. C. Fossorier, Hideki Imai   +2 more
openaire   +1 more source

A Note on the Optimal Immunity of Boolean Functions Against Fast Algebraic Attacks

2017
The 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

A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation

2006
This paper proposes a novel approach for cryptanalysis of certain cryptographic pseudorandom sequence (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 ...
Miodrag J. Mihaljević, Marc P. C. Fossorier, Hideki Imai   +2 more
openaire   +1 more source

Combining MILP modeling with algebraic bias evaluation for linear mask search: improved fast correlation attacks on SNOW

Designs, Codes and Cryptography
The Mixed Integer Linear Programming (MILP) technique has been widely applied in the realm of symmetric-key cryptanalysis. In this paper, we propose a new bitwise breakdown MILP modeling strategy for describing the linear propagation rules of modular addition-based operations.
Gong, Xinxin, Hao, Yonglin, Wang, Qingju
openaire   +3 more sources

Cancer risk among World Trade Center rescue and recovery workers: A review

Ca-A Cancer Journal for Clinicians, 2022
Paolo Boffetta, Charles B Hall, Andrew C Todd   +2 more
exaly  

Fast Algebraic Immunity of Boolean Functions and LCD Codes

IEEE Transactions on Information Theory, 2021
Sihem Mesnager, Chunming Tang
exaly  

On the fast algebraic immunity of threshold functions

Cryptography and Communications, 2021
Pierrick Méaux
exaly  

Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions

IEEE Transactions on Information Theory, 2011
Meicheng Liu
exaly