Sciweavers

FSE
2004
Springer

Correlation Attacks Using a New Class of Weak Feedback Polynomials

13 years 9 months ago
Correlation Attacks Using a New Class of Weak Feedback Polynomials
In 1985 Siegenthaler introduced the concept of correlation attacks on LFSR based stream ciphers. A few years later Meier and Staffelbach demonstrated a special technique, usually referred to as fast correlation attacks, that is very effective if the feedback polynomial has a special form, namely, if its weight is very low. Due to this seminal result, it is a well known fact that one avoids low weight feedback polynomials in the design of LFSR based stream ciphers. This paper identifies a new class of such weak feedback polynomials, polynomials of the form f(x) = g1(x) + g2(x)xM1 + . . . + gt(x)xMt−1 , where g1, g2, . . . , gt are all polynomials of low degree. For such feedback polynomials, we identify an efficient correlation attack in the form of a distinguishing attack.
Håkan Englund, Martin Hell, Thomas Johansson
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where FSE
Authors Håkan Englund, Martin Hell, Thomas Johansson
Comments (0)