Results 161 to 169 of about 650 (169)
Some of the next articles are maybe not open access.

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

Fast Algebraic Immunity of Boolean Functions and LCD Codes

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

Fast algebraic immunity of Boolean functions

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

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

Cryptography and Communications, 2011
Enes Pašalić, Pašalić Enes
exaly  

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

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

Home - About - Disclaimer - Privacy