Remarks on the new attack on the filter generator and the role of high order complexity

Authors:
Panagiotis Rizomiliotis
Affiliations:
K.U.Leuven, ESAT/COSIC, Leuven-Heverlee, Belgium
Venue:
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Year:
2007

Citing 4
Cited 0

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Shift Register Sequences

Shift Register Sequences
Results on the nonlinear span of binary sequences

IEEE Transactions on Information Theory
A New Attack on the Filter Generator

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Filter generators are important building blocks of stream ciphers and have been studied extensively. Recently, a new attack has been proposed. In this paper, we analyze this attack using the trace representation of the output sequence y and we prove that the attack does not work always as expected. We propose a new algorithm that covers the cases that the attack cannot be applied. The new attack is as efficient as the original attack. Finally, trying to motivate the research on the non-linear complexity of binary sequences, we present a scenario where the knowledge of the quadratic complexity of a sequence can decrease significantly the necessary for the attack amount of known keystream bits.