Results 121 to 130 of about 487 (136)

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

Introducing a New Variant of Fast Algebraic Attacks and Minimizing Their Successive Data Complexity

2005
Algebraic 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

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. Mihaljevic, 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.
Xinxin Gong, Yonglin Hao, Qingju Wang 0001   +2 more
openaire   +4 more sources

On the fast algebraic immunity of threshold functions

Cryptography and Communications, 2021
Pierrick Meaux
exaly  

Notion of Algebraic Immunity and Its evaluation Related to Fast Algebraic Attacks.

IACR Cryptol. ePrint Arch., 2006
Deepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra   +2 more
openaire   +1 more source

Fast algebraic immunity of Boolean functions

Advances in Mathematics of Communications, 2017
Sihem Mesnager, Gérard Cohen
exaly  

The Exact Fast Algebraic Immunity of Two Subclasses of the Majority Function

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2016
Rong Luo, Deng Tang, Du Xiaoni
exaly  

On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation

IEEE Transactions on Information Theory, 2010
Panagiotis Rizomiliotis
exaly  

On the Fast Algebraic Immunity of Majority Functions

Lecture Notes in Computer Science, 2019
Pierrick Meaux
exaly