Results 121 to 130 of about 2,028,418 (131)

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   +4 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   +2 more sources

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   +5 more sources

Fast Algebraic Immunity of Boolean Functions and LCD Codes

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

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

IEEE Transactions on Information Theory, 2010
Panagiotis Rizomiliotis
exaly  

Fast algebraic immunity of Boolean functions

Advances in Mathematics of Communications, 2017
Sihem Mesnager
exaly  

A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation

Cryptography and Communications, 2011
Enes Pasalic
exaly  

SPEEDING UP AIDA THE ALGEBRAIC IV DIFFERENTIAL ATTACK BY THE FAST REED-MULLER TRANSFORM

Intelligent Decision Making Systems, 2009
openaire   +1 more source

CTC2 and Fast Algebraic Attacks on Block Ciphers Revisited.

IACR Cryptol. ePrint Arch., 2007
openaire   +1 more source

Evolving balanced Boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity.

IACR Cryptol. ePrint Arch., 2013
James McLaughlin 0003, John A. Clark
openaire   +1 more source